/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 14:29:51,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 14:29:51,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 14:29:51,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 14:29:51,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 14:29:51,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 14:29:51,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 14:29:51,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 14:29:51,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 14:29:51,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 14:29:51,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 14:29:51,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 14:29:51,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 14:29:51,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 14:29:51,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 14:29:51,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 14:29:51,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 14:29:51,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 14:29:51,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 14:29:51,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 14:29:51,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 14:29:51,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 14:29:51,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 14:29:51,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 14:29:51,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 14:29:51,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 14:29:51,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 14:29:51,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 14:29:51,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 14:29:51,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 14:29:51,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 14:29:51,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 14:29:51,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 14:29:51,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 14:29:51,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 14:29:51,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 14:29:51,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 14:29:51,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 14:29:51,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 14:29:51,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 14:29:51,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 14:29:51,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 14:29:51,394 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 14:29:51,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 14:29:51,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 14:29:51,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 14:29:51,396 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 14:29:51,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 14:29:51,397 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 14:29:51,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 14:29:51,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 14:29:51,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 14:29:51,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 14:29:51,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 14:29:51,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 14:29:51,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 14:29:51,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 14:29:51,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 14:29:51,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 14:29:51,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 14:29:51,400 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-06-11 14:29:51,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 14:29:51,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 14:29:51,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 14:29:51,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 14:29:51,649 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 14:29:51,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-06-11 14:29:51,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcd36e3b/ed0dc25e37b94de0a745ff0ac962fcca/FLAGa839aa8e8 [2021-06-11 14:29:52,117 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 14:29:52,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-06-11 14:29:52,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcd36e3b/ed0dc25e37b94de0a745ff0ac962fcca/FLAGa839aa8e8 [2021-06-11 14:29:52,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afcd36e3b/ed0dc25e37b94de0a745ff0ac962fcca [2021-06-11 14:29:52,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 14:29:52,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 14:29:52,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 14:29:52,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 14:29:52,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 14:29:52,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2476572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52, skipping insertion in model container [2021-06-11 14:29:52,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 14:29:52,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 14:29:52,470 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-06-11 14:29:52,473 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-06-11 14:29:52,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 14:29:52,496 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 14:29:52,529 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-06-11 14:29:52,530 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-06-11 14:29:52,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 14:29:52,589 INFO L208 MainTranslator]: Completed translation [2021-06-11 14:29:52,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52 WrapperNode [2021-06-11 14:29:52,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 14:29:52,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 14:29:52,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 14:29:52,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 14:29:52,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 14:29:52,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 14:29:52,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 14:29:52,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 14:29:52,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... [2021-06-11 14:29:52,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 14:29:52,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 14:29:52,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 14:29:52,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 14:29:52,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 14:29:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-06-11 14:29:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-06-11 14:29:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-06-11 14:29:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 14:29:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 14:29:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 14:29:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 14:29:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 14:29:52,751 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 14:29:53,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 14:29:53,462 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-06-11 14:29:53,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 02:29:53 BoogieIcfgContainer [2021-06-11 14:29:53,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 14:29:53,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 14:29:53,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 14:29:53,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 14:29:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 02:29:52" (1/3) ... [2021-06-11 14:29:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79da17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 02:29:53, skipping insertion in model container [2021-06-11 14:29:53,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 02:29:52" (2/3) ... [2021-06-11 14:29:53,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79da17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 02:29:53, skipping insertion in model container [2021-06-11 14:29:53,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 02:29:53" (3/3) ... [2021-06-11 14:29:53,469 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-06-11 14:29:53,472 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 14:29:53,475 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 14:29:53,476 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 14:29:53,512 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,512 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,512 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,513 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,513 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,513 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,513 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,513 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,514 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,515 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,516 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,516 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,516 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,516 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,516 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,517 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,517 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,517 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,518 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,519 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,520 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,522 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,523 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,524 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,525 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,526 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,527 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,527 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,527 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,528 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,530 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,530 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,530 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,530 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,534 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,535 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,536 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,537 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,538 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,539 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,542 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,542 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,542 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,542 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,543 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,544 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,545 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,545 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,545 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,546 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,547 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,548 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,549 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,550 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,555 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,555 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,555 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,555 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,555 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,556 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,559 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,559 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,559 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,559 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,560 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,560 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,561 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,562 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,563 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,564 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,565 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,566 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,567 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,568 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,569 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,570 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,571 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,572 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,572 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,573 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,574 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,574 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,574 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,574 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,575 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,576 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,576 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,576 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,577 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,578 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,579 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,579 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,579 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,580 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,581 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,582 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,582 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,582 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,582 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 14:29:53,586 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-06-11 14:29:53,598 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 14:29:53,619 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 14:29:53,619 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 14:29:53,619 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 14:29:53,619 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 14:29:53,619 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 14:29:53,619 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 14:29:53,619 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 14:29:53,619 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 14:29:53,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-06-11 14:29:53,668 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-06-11 14:29:53,668 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-06-11 14:29:53,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 183 events. 23/183 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 449 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-06-11 14:29:53,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-06-11 14:29:53,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-06-11 14:29:53,677 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:29:53,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-06-11 14:29:53,687 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-06-11 14:29:53,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-06-11 14:29:53,710 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-06-11 14:29:53,711 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-06-11 14:29:53,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 170 events. 21/170 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 433 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-06-11 14:29:53,737 INFO L151 LiptonReduction]: Number of co-enabled transitions 10120 [2021-06-11 14:29:53,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:53,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:53,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:53,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:53,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:53,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:53,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:53,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,086 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.5 percent of original size [2021-06-11 14:29:54,093 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:54,094 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:54,112 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:29:54,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:54,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:54,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:29:54,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,325 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.5 percent of original size [2021-06-11 14:29:54,328 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:54,328 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:54,330 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:29:54,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:54,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:54,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:29:54,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:54,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:54,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:29:54,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:54,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:54,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:29:54,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:54,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:54,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,103 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.5 percent of original size [2021-06-11 14:29:55,105 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:55,105 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:55,106 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:29:55,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:29:55,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,413 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:55,413 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:55,417 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,753 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-06-11 14:29:55,755 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:55,755 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:55,756 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:55,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:55,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 14:29:56,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 14:29:56,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 14:29:56,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 14:29:56,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 14:29:56,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 14:29:56,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,314 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.7 percent of original size [2021-06-11 14:29:56,318 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:29:56,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,492 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 14:29:56,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 14:29:56,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:56,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:56,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:29:56,706 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-06-11 14:29:56,708 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:56,708 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:56,709 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:56,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:56,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:57,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 14:29:57,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 14:29:57,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 14:29:57,162 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 14:29:57,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 14:29:57,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 14:29:57,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 14:29:57,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 14:29:57,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 14:29:57,203 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.7 percent of original size [2021-06-11 14:29:57,205 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:29:57,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,338 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-06-11 14:29:57,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,441 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-06-11 14:29:57,446 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:29:57,503 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-06-11 14:29:57,511 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:57,511 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:57,512 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,536 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-06-11 14:29:57,540 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:29:57,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,705 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:57,706 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:57,706 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:57,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 14:29:57,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 14:29:57,919 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,920 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 14:29:57,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 14:29:57,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:57,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:57,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 14:29:57,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 14:29:58,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 14:29:58,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 14:29:58,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,131 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 14:29:58,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 14:29:58,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 14:29:58,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 14:29:58,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 14:29:58,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 14:29:58,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,506 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,509 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 14:29:58,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 14:29:58,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-06-11 14:29:58,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 14:29:58,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 14:29:58,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 14:29:58,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:58,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 14:29:58,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-06-11 14:29:58,713 INFO L142 QuantifierPusher]: treesize reduction 2, result has 98.2 percent of original size [2021-06-11 14:29:58,714 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-06-11 14:29:58,714 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 14:29:58,715 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:58,718 INFO L147 QuantifierPusher]: treesize reduction 8, result has 77.8 percent of original size 28 [2021-06-11 14:29:59,090 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2021-06-11 14:29:59,238 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 14:29:59,541 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2021-06-11 14:29:59,678 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 14:29:59,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 14:29:59,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 14:29:59,696 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-06-11 14:29:59,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 14:29:59,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 14:29:59,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 14:29:59,700 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-06-11 14:29:59,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-06-11 14:29:59,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 14:29:59,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2021-06-11 14:29:59,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 14:29:59,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:29:59,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:29:59,967 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-06-11 14:30:00,143 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-06-11 14:30:00,308 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-06-11 14:30:00,467 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-06-11 14:30:00,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:00,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:00,487 INFO L163 LiptonReduction]: Checked pairs total: 22093 [2021-06-11 14:30:00,488 INFO L165 LiptonReduction]: Total number of compositions: 124 [2021-06-11 14:30:00,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6814 [2021-06-11 14:30:00,498 INFO L129 PetriNetUnfolder]: 10/53 cut-off events. [2021-06-11 14:30:00,498 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 14:30:00,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:00,499 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:00,499 INFO L428 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash 907572162, now seen corresponding path program 1 times [2021-06-11 14:30:00,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:00,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898185476] [2021-06-11 14:30:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:00,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:00,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:00,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:00,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 14:30:00,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:00,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:00,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898185476] [2021-06-11 14:30:00,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:00,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 14:30:00,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605865173] [2021-06-11 14:30:00,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 14:30:00,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 14:30:00,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 14:30:00,651 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 299 [2021-06-11 14:30:00,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:00,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:00,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 299 [2021-06-11 14:30:00,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:00,707 INFO L129 PetriNetUnfolder]: 17/91 cut-off events. [2021-06-11 14:30:00,707 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-06-11 14:30:00,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 91 events. 17/91 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 278 event pairs, 0 based on Foata normal form. 26/91 useless extension candidates. Maximal degree in co-relation 105. Up to 12 conditions per place. [2021-06-11 14:30:00,710 INFO L132 encePairwiseOnDemand]: 293/299 looper letters, 13 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2021-06-11 14:30:00,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 205 flow [2021-06-11 14:30:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 14:30:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 14:30:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2021-06-11 14:30:00,724 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2021-06-11 14:30:00,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2021-06-11 14:30:00,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2021-06-11 14:30:00,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:00,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2021-06-11 14:30:00,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 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) [2021-06-11 14:30:00,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:00,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:00,742 INFO L185 Difference]: Start difference. First operand has 65 places, 73 transitions, 173 flow. Second operand 3 states and 780 transitions. [2021-06-11 14:30:00,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 205 flow [2021-06-11 14:30:00,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-06-11 14:30:00,747 INFO L241 Difference]: Finished difference. Result has 63 places, 73 transitions, 173 flow [2021-06-11 14:30:00,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2021-06-11 14:30:00,749 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, -2 predicate places. [2021-06-11 14:30:00,749 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:00,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 73 transitions, 173 flow [2021-06-11 14:30:00,750 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 173 flow [2021-06-11 14:30:00,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 173 flow [2021-06-11 14:30:00,759 INFO L129 PetriNetUnfolder]: 17/91 cut-off events. [2021-06-11 14:30:00,759 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 14:30:00,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 91 events. 17/91 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 293 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2021-06-11 14:30:00,762 INFO L151 LiptonReduction]: Number of co-enabled transitions 2970 [2021-06-11 14:30:00,860 INFO L163 LiptonReduction]: Checked pairs total: 2112 [2021-06-11 14:30:00,860 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:00,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111 [2021-06-11 14:30:00,861 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 173 flow [2021-06-11 14:30:00,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:00,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:00,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:00,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 14:30:00,862 INFO L428 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1925006484, now seen corresponding path program 1 times [2021-06-11 14:30:00,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:00,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146631015] [2021-06-11 14:30:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:00,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:00,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:00,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146631015] [2021-06-11 14:30:00,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:00,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 14:30:00,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501948224] [2021-06-11 14:30:00,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 14:30:00,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:00,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 14:30:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 14:30:00,971 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 299 [2021-06-11 14:30:00,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 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) [2021-06-11 14:30:00,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:00,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 299 [2021-06-11 14:30:00,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:00,996 INFO L129 PetriNetUnfolder]: 24/117 cut-off events. [2021-06-11 14:30:00,996 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-06-11 14:30:00,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 117 events. 24/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 438 event pairs, 2 based on Foata normal form. 2/93 useless extension candidates. Maximal degree in co-relation 106. Up to 16 conditions per place. [2021-06-11 14:30:00,997 INFO L132 encePairwiseOnDemand]: 296/299 looper letters, 4 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2021-06-11 14:30:00,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 187 flow [2021-06-11 14:30:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 14:30:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 14:30:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2021-06-11 14:30:00,999 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9007803790412486 [2021-06-11 14:30:00,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2021-06-11 14:30:00,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2021-06-11 14:30:00,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:00,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2021-06-11 14:30:01,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 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) [2021-06-11 14:30:01,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:01,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:01,002 INFO L185 Difference]: Start difference. First operand has 63 places, 73 transitions, 173 flow. Second operand 3 states and 808 transitions. [2021-06-11 14:30:01,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 187 flow [2021-06-11 14:30:01,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 14:30:01,005 INFO L241 Difference]: Finished difference. Result has 65 places, 73 transitions, 178 flow [2021-06-11 14:30:01,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2021-06-11 14:30:01,006 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2021-06-11 14:30:01,006 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:01,006 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 73 transitions, 178 flow [2021-06-11 14:30:01,006 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 73 transitions, 178 flow [2021-06-11 14:30:01,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 73 transitions, 178 flow [2021-06-11 14:30:01,013 INFO L129 PetriNetUnfolder]: 17/91 cut-off events. [2021-06-11 14:30:01,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 14:30:01,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 91 events. 17/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 306 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 88. Up to 10 conditions per place. [2021-06-11 14:30:01,015 INFO L151 LiptonReduction]: Number of co-enabled transitions 2948 [2021-06-11 14:30:01,062 INFO L163 LiptonReduction]: Checked pairs total: 1996 [2021-06-11 14:30:01,062 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:01,062 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-06-11 14:30:01,065 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 178 flow [2021-06-11 14:30:01,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 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) [2021-06-11 14:30:01,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:01,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:01,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 14:30:01,065 INFO L428 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1925006653, now seen corresponding path program 1 times [2021-06-11 14:30:01,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:01,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104430399] [2021-06-11 14:30:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:01,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:01,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104430399] [2021-06-11 14:30:01,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:01,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 14:30:01,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537241929] [2021-06-11 14:30:01,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 14:30:01,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 14:30:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 14:30:01,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 299 [2021-06-11 14:30:01,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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) [2021-06-11 14:30:01,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:01,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 299 [2021-06-11 14:30:01,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:01,150 INFO L129 PetriNetUnfolder]: 41/183 cut-off events. [2021-06-11 14:30:01,151 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 14:30:01,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 799 event pairs, 3 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 215. Up to 18 conditions per place. [2021-06-11 14:30:01,152 INFO L132 encePairwiseOnDemand]: 296/299 looper letters, 4 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2021-06-11 14:30:01,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 192 flow [2021-06-11 14:30:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 14:30:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 14:30:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-06-11 14:30:01,154 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.907469342251951 [2021-06-11 14:30:01,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-06-11 14:30:01,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-06-11 14:30:01,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:01,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-06-11 14:30:01,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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) [2021-06-11 14:30:01,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:01,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 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) [2021-06-11 14:30:01,157 INFO L185 Difference]: Start difference. First operand has 65 places, 73 transitions, 178 flow. Second operand 3 states and 814 transitions. [2021-06-11 14:30:01,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 192 flow [2021-06-11 14:30:01,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 14:30:01,160 INFO L241 Difference]: Finished difference. Result has 66 places, 73 transitions, 182 flow [2021-06-11 14:30:01,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2021-06-11 14:30:01,160 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2021-06-11 14:30:01,160 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:01,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 73 transitions, 182 flow [2021-06-11 14:30:01,160 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 73 transitions, 182 flow [2021-06-11 14:30:01,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 73 transitions, 182 flow [2021-06-11 14:30:01,166 INFO L129 PetriNetUnfolder]: 17/91 cut-off events. [2021-06-11 14:30:01,166 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 14:30:01,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 91 events. 17/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 317 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 94. Up to 10 conditions per place. [2021-06-11 14:30:01,167 INFO L151 LiptonReduction]: Number of co-enabled transitions 2926 [2021-06-11 14:30:01,189 INFO L163 LiptonReduction]: Checked pairs total: 1876 [2021-06-11 14:30:01,189 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:01,189 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 14:30:01,190 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 182 flow [2021-06-11 14:30:01,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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) [2021-06-11 14:30:01,191 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:01,191 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:01,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 14:30:01,191 INFO L428 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1191252375, now seen corresponding path program 1 times [2021-06-11 14:30:01,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:01,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018369889] [2021-06-11 14:30:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:01,233 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-06-11 14:30:01,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:30:01,265 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:30:01,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:01,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:01,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018369889] [2021-06-11 14:30:01,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:01,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:30:01,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63344819] [2021-06-11 14:30:01,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 14:30:01,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 14:30:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 14:30:01,268 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 299 [2021-06-11 14:30:01,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 208.8) internal successors, (1044), 5 states have internal predecessors, (1044), 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) [2021-06-11 14:30:01,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:01,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 299 [2021-06-11 14:30:01,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:01,463 INFO L129 PetriNetUnfolder]: 406/848 cut-off events. [2021-06-11 14:30:01,463 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 14:30:01,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 848 events. 406/848 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4861 event pairs, 18 based on Foata normal form. 74/830 useless extension candidates. Maximal degree in co-relation 978. Up to 412 conditions per place. [2021-06-11 14:30:01,470 INFO L132 encePairwiseOnDemand]: 282/299 looper letters, 67 selfloop transitions, 27 changer transitions 0/134 dead transitions. [2021-06-11 14:30:01,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 134 transitions, 533 flow [2021-06-11 14:30:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 14:30:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 14:30:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1552 transitions. [2021-06-11 14:30:01,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7415193502150024 [2021-06-11 14:30:01,494 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1552 transitions. [2021-06-11 14:30:01,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1552 transitions. [2021-06-11 14:30:01,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:01,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1552 transitions. [2021-06-11 14:30:01,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.71428571428572) internal successors, (1552), 7 states have internal predecessors, (1552), 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) [2021-06-11 14:30:01,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 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) [2021-06-11 14:30:01,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 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) [2021-06-11 14:30:01,501 INFO L185 Difference]: Start difference. First operand has 66 places, 73 transitions, 182 flow. Second operand 7 states and 1552 transitions. [2021-06-11 14:30:01,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 134 transitions, 533 flow [2021-06-11 14:30:01,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 134 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 14:30:01,503 INFO L241 Difference]: Finished difference. Result has 75 places, 99 transitions, 409 flow [2021-06-11 14:30:01,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=75, PETRI_TRANSITIONS=99} [2021-06-11 14:30:01,504 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2021-06-11 14:30:01,504 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:01,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 99 transitions, 409 flow [2021-06-11 14:30:01,504 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 99 transitions, 409 flow [2021-06-11 14:30:01,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 99 transitions, 409 flow [2021-06-11 14:30:01,541 INFO L129 PetriNetUnfolder]: 185/507 cut-off events. [2021-06-11 14:30:01,541 INFO L130 PetriNetUnfolder]: For 418/479 co-relation queries the response was YES. [2021-06-11 14:30:01,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 507 events. 185/507 cut-off events. For 418/479 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3221 event pairs, 16 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 1025. Up to 94 conditions per place. [2021-06-11 14:30:01,549 INFO L151 LiptonReduction]: Number of co-enabled transitions 3864 [2021-06-11 14:30:01,575 INFO L163 LiptonReduction]: Checked pairs total: 1833 [2021-06-11 14:30:01,576 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:01,576 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-06-11 14:30:01,576 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 99 transitions, 409 flow [2021-06-11 14:30:01,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 208.8) internal successors, (1044), 5 states have internal predecessors, (1044), 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) [2021-06-11 14:30:01,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:01,577 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:01,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 14:30:01,577 INFO L428 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:01,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash -636340889, now seen corresponding path program 1 times [2021-06-11 14:30:01,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:01,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995428254] [2021-06-11 14:30:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:01,629 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-06-11 14:30:01,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:01,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:01,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:01,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:01,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995428254] [2021-06-11 14:30:01,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:01,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:30:01,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665341385] [2021-06-11 14:30:01,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 14:30:01,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 14:30:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 14:30:01,663 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 299 [2021-06-11 14:30:01,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 99 transitions, 409 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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) [2021-06-11 14:30:01,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:01,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 299 [2021-06-11 14:30:01,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:02,021 INFO L129 PetriNetUnfolder]: 467/1038 cut-off events. [2021-06-11 14:30:02,021 INFO L130 PetriNetUnfolder]: For 1755/1794 co-relation queries the response was YES. [2021-06-11 14:30:02,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 1038 events. 467/1038 cut-off events. For 1755/1794 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6561 event pairs, 3 based on Foata normal form. 46/1010 useless extension candidates. Maximal degree in co-relation 2755. Up to 326 conditions per place. [2021-06-11 14:30:02,031 INFO L132 encePairwiseOnDemand]: 280/299 looper letters, 82 selfloop transitions, 34 changer transitions 0/156 dead transitions. [2021-06-11 14:30:02,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 156 transitions, 936 flow [2021-06-11 14:30:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 14:30:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 14:30:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1761 transitions. [2021-06-11 14:30:02,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7362040133779264 [2021-06-11 14:30:02,034 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1761 transitions. [2021-06-11 14:30:02,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1761 transitions. [2021-06-11 14:30:02,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:02,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1761 transitions. [2021-06-11 14:30:02,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 220.125) internal successors, (1761), 8 states have internal predecessors, (1761), 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) [2021-06-11 14:30:02,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 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) [2021-06-11 14:30:02,041 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 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) [2021-06-11 14:30:02,041 INFO L185 Difference]: Start difference. First operand has 75 places, 99 transitions, 409 flow. Second operand 8 states and 1761 transitions. [2021-06-11 14:30:02,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 156 transitions, 936 flow [2021-06-11 14:30:02,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 156 transitions, 936 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 14:30:02,049 INFO L241 Difference]: Finished difference. Result has 87 places, 117 transitions, 668 flow [2021-06-11 14:30:02,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=87, PETRI_TRANSITIONS=117} [2021-06-11 14:30:02,050 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 22 predicate places. [2021-06-11 14:30:02,050 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:02,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 117 transitions, 668 flow [2021-06-11 14:30:02,050 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 117 transitions, 668 flow [2021-06-11 14:30:02,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 117 transitions, 668 flow [2021-06-11 14:30:02,104 INFO L129 PetriNetUnfolder]: 217/666 cut-off events. [2021-06-11 14:30:02,104 INFO L130 PetriNetUnfolder]: For 927/997 co-relation queries the response was YES. [2021-06-11 14:30:02,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 666 events. 217/666 cut-off events. For 927/997 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4688 event pairs, 15 based on Foata normal form. 11/613 useless extension candidates. Maximal degree in co-relation 1581. Up to 129 conditions per place. [2021-06-11 14:30:02,115 INFO L151 LiptonReduction]: Number of co-enabled transitions 4612 [2021-06-11 14:30:02,125 INFO L163 LiptonReduction]: Checked pairs total: 2527 [2021-06-11 14:30:02,126 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:02,126 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-06-11 14:30:02,129 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 117 transitions, 668 flow [2021-06-11 14:30:02,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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) [2021-06-11 14:30:02,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:02,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:02,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 14:30:02,129 INFO L428 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:02,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1310254437, now seen corresponding path program 1 times [2021-06-11 14:30:02,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:02,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620642662] [2021-06-11 14:30:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:02,204 INFO L142 QuantifierPusher]: treesize reduction 10, result has 50.0 percent of original size [2021-06-11 14:30:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:02,210 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-06-11 14:30:02,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:02,218 INFO L142 QuantifierPusher]: treesize reduction 10, result has 50.0 percent of original size [2021-06-11 14:30:02,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:02,229 INFO L142 QuantifierPusher]: treesize reduction 10, result has 50.0 percent of original size [2021-06-11 14:30:02,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:02,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:02,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:02,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620642662] [2021-06-11 14:30:02,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:02,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:30:02,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3010575] [2021-06-11 14:30:02,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:30:02,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:30:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:30:02,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 299 [2021-06-11 14:30:02,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 117 transitions, 668 flow. Second operand has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 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) [2021-06-11 14:30:02,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:02,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 299 [2021-06-11 14:30:02,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:04,677 INFO L129 PetriNetUnfolder]: 20770/29505 cut-off events. [2021-06-11 14:30:04,677 INFO L130 PetriNetUnfolder]: For 35489/36557 co-relation queries the response was YES. [2021-06-11 14:30:04,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82508 conditions, 29505 events. 20770/29505 cut-off events. For 35489/36557 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 191298 event pairs, 2850 based on Foata normal form. 389/19538 useless extension candidates. Maximal degree in co-relation 64147. Up to 20243 conditions per place. [2021-06-11 14:30:04,902 INFO L132 encePairwiseOnDemand]: 281/299 looper letters, 167 selfloop transitions, 31 changer transitions 15/245 dead transitions. [2021-06-11 14:30:04,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 245 transitions, 1477 flow [2021-06-11 14:30:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 14:30:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 14:30:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1394 transitions. [2021-06-11 14:30:04,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5827759197324415 [2021-06-11 14:30:04,905 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1394 transitions. [2021-06-11 14:30:04,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1394 transitions. [2021-06-11 14:30:04,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:04,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1394 transitions. [2021-06-11 14:30:04,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 174.25) internal successors, (1394), 8 states have internal predecessors, (1394), 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) [2021-06-11 14:30:04,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 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) [2021-06-11 14:30:04,910 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 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) [2021-06-11 14:30:04,911 INFO L185 Difference]: Start difference. First operand has 87 places, 117 transitions, 668 flow. Second operand 8 states and 1394 transitions. [2021-06-11 14:30:04,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 245 transitions, 1477 flow [2021-06-11 14:30:05,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 245 transitions, 1461 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 14:30:05,450 INFO L241 Difference]: Finished difference. Result has 98 places, 141 transitions, 914 flow [2021-06-11 14:30:05,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=914, PETRI_PLACES=98, PETRI_TRANSITIONS=141} [2021-06-11 14:30:05,450 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 33 predicate places. [2021-06-11 14:30:05,451 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:05,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 141 transitions, 914 flow [2021-06-11 14:30:05,451 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 141 transitions, 914 flow [2021-06-11 14:30:05,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 141 transitions, 914 flow [2021-06-11 14:30:05,589 INFO L129 PetriNetUnfolder]: 427/1084 cut-off events. [2021-06-11 14:30:05,589 INFO L130 PetriNetUnfolder]: For 1955/2060 co-relation queries the response was YES. [2021-06-11 14:30:05,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 1084 events. 427/1084 cut-off events. For 1955/2060 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7912 event pairs, 71 based on Foata normal form. 19/901 useless extension candidates. Maximal degree in co-relation 2926. Up to 170 conditions per place. [2021-06-11 14:30:05,612 INFO L151 LiptonReduction]: Number of co-enabled transitions 4952 [2021-06-11 14:30:05,641 INFO L163 LiptonReduction]: Checked pairs total: 2784 [2021-06-11 14:30:05,641 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:05,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 190 [2021-06-11 14:30:05,642 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 141 transitions, 914 flow [2021-06-11 14:30:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 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) [2021-06-11 14:30:05,643 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:05,643 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:05,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 14:30:05,643 INFO L428 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:05,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash -667371779, now seen corresponding path program 1 times [2021-06-11 14:30:05,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:05,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390595931] [2021-06-11 14:30:05,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:05,703 INFO L142 QuantifierPusher]: treesize reduction 5, result has 66.7 percent of original size [2021-06-11 14:30:05,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:05,720 INFO L142 QuantifierPusher]: treesize reduction 5, result has 66.7 percent of original size [2021-06-11 14:30:05,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:05,726 INFO L142 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-06-11 14:30:05,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:05,735 INFO L142 QuantifierPusher]: treesize reduction 16, result has 46.7 percent of original size [2021-06-11 14:30:05,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:05,736 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-06-11 14:30:05,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:05,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:05,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 14:30:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:05,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390595931] [2021-06-11 14:30:05,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:05,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:30:05,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210576688] [2021-06-11 14:30:05,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 14:30:05,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 14:30:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 14:30:05,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 299 [2021-06-11 14:30:05,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 141 transitions, 914 flow. Second operand has 6 states, 6 states have (on average 156.33333333333334) internal successors, (938), 6 states have internal predecessors, (938), 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) [2021-06-11 14:30:05,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:05,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 299 [2021-06-11 14:30:05,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:09,491 INFO L129 PetriNetUnfolder]: 33056/46669 cut-off events. [2021-06-11 14:30:09,492 INFO L130 PetriNetUnfolder]: For 74287/76457 co-relation queries the response was YES. [2021-06-11 14:30:09,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149745 conditions, 46669 events. 33056/46669 cut-off events. For 74287/76457 co-relation queries the response was YES. Maximal size of possible extension queue 1930. Compared 312299 event pairs, 3767 based on Foata normal form. 889/30364 useless extension candidates. Maximal degree in co-relation 136451. Up to 17379 conditions per place. [2021-06-11 14:30:10,018 INFO L132 encePairwiseOnDemand]: 283/299 looper letters, 238 selfloop transitions, 80 changer transitions 28/380 dead transitions. [2021-06-11 14:30:10,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 380 transitions, 2748 flow [2021-06-11 14:30:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 14:30:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 14:30:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1768 transitions. [2021-06-11 14:30:10,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.591304347826087 [2021-06-11 14:30:10,022 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1768 transitions. [2021-06-11 14:30:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1768 transitions. [2021-06-11 14:30:10,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:10,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1768 transitions. [2021-06-11 14:30:10,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 176.8) internal successors, (1768), 10 states have internal predecessors, (1768), 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) [2021-06-11 14:30:10,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 299.0) internal successors, (3289), 11 states have internal predecessors, (3289), 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) [2021-06-11 14:30:10,029 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 299.0) internal successors, (3289), 11 states have internal predecessors, (3289), 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) [2021-06-11 14:30:10,029 INFO L185 Difference]: Start difference. First operand has 98 places, 141 transitions, 914 flow. Second operand 10 states and 1768 transitions. [2021-06-11 14:30:10,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 380 transitions, 2748 flow [2021-06-11 14:30:10,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 380 transitions, 2730 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-06-11 14:30:10,927 INFO L241 Difference]: Finished difference. Result has 114 places, 195 transitions, 1596 flow [2021-06-11 14:30:10,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1596, PETRI_PLACES=114, PETRI_TRANSITIONS=195} [2021-06-11 14:30:10,928 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 49 predicate places. [2021-06-11 14:30:10,928 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:10,928 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 195 transitions, 1596 flow [2021-06-11 14:30:10,928 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 195 transitions, 1596 flow [2021-06-11 14:30:10,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 195 transitions, 1596 flow [2021-06-11 14:30:11,279 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] L739-->qrcu_reader1EXIT: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#res.offset_17| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|) (= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|) (let ((.cse0 (<= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43 0))) (or (and (= (+ v_~ctr1~0_305 1) v_~ctr1~0_306) (= v_~ctr2~0_320 v_~ctr2~0_319) .cse0 (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_43| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_69|)) (and (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_43| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_69|) (= v_~ctr1~0_306 v_~ctr1~0_305) (= v_~ctr2~0_320 (+ v_~ctr2~0_319 1)) (not .cse0)))) (= |v_qrcu_reader1Thread1of1ForFork0_#res.base_17| 0)) InVars {~ctr1~0=v_~ctr1~0_306, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101, ~ctr2~0=v_~ctr2~0_320} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_43|, qrcu_reader1Thread1of1ForFork0_#res.offset=|v_qrcu_reader1Thread1of1ForFork0_#res.offset_17|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43, ~ctr1~0=v_~ctr1~0_305, qrcu_reader1Thread1of1ForFork0_#res.base=|v_qrcu_reader1Thread1of1ForFork0_#res.base_17|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|, ~ctr2~0=v_~ctr2~0_319, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_43|} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_69|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_69|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8, qrcu_reader1Thread1of1ForFork0_#res.offset, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx, ~ctr1~0, qrcu_reader1Thread1of1ForFork0_#res.base, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7][143], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 71#L771-9true, Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:11,280 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:11,280 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:11,280 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:11,280 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:11,290 INFO L129 PetriNetUnfolder]: 1593/3910 cut-off events. [2021-06-11 14:30:11,291 INFO L130 PetriNetUnfolder]: For 11611/12269 co-relation queries the response was YES. [2021-06-11 14:30:11,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13815 conditions, 3910 events. 1593/3910 cut-off events. For 11611/12269 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 36692 event pairs, 148 based on Foata normal form. 80/3198 useless extension candidates. Maximal degree in co-relation 13115. Up to 601 conditions per place. [2021-06-11 14:30:11,340 INFO L151 LiptonReduction]: Number of co-enabled transitions 6054 [2021-06-11 14:30:11,381 INFO L163 LiptonReduction]: Checked pairs total: 2334 [2021-06-11 14:30:11,381 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:11,381 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 453 [2021-06-11 14:30:11,382 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 195 transitions, 1596 flow [2021-06-11 14:30:11,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.33333333333334) internal successors, (938), 6 states have internal predecessors, (938), 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) [2021-06-11 14:30:11,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:11,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:11,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 14:30:11,382 INFO L428 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1551087191, now seen corresponding path program 2 times [2021-06-11 14:30:11,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:11,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881289912] [2021-06-11 14:30:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:11,410 INFO L142 QuantifierPusher]: treesize reduction 5, result has 66.7 percent of original size [2021-06-11 14:30:11,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:11,415 INFO L142 QuantifierPusher]: treesize reduction 5, result has 66.7 percent of original size [2021-06-11 14:30:11,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:11,422 INFO L142 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-06-11 14:30:11,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:11,429 INFO L142 QuantifierPusher]: treesize reduction 16, result has 46.7 percent of original size [2021-06-11 14:30:11,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:11,430 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-06-11 14:30:11,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 14:30:11,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:11,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 14:30:11,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:11,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 14:30:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:11,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881289912] [2021-06-11 14:30:11,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:11,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:30:11,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876413092] [2021-06-11 14:30:11,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:30:11,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:30:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:30:11,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 299 [2021-06-11 14:30:11,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 195 transitions, 1596 flow. Second operand has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 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) [2021-06-11 14:30:11,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:11,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 299 [2021-06-11 14:30:11,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:16,650 INFO L129 PetriNetUnfolder]: 42393/59182 cut-off events. [2021-06-11 14:30:16,651 INFO L130 PetriNetUnfolder]: For 162993/167577 co-relation queries the response was YES. [2021-06-11 14:30:17,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 249266 conditions, 59182 events. 42393/59182 cut-off events. For 162993/167577 co-relation queries the response was YES. Maximal size of possible extension queue 2708. Compared 398017 event pairs, 5170 based on Foata normal form. 1114/37372 useless extension candidates. Maximal degree in co-relation 229431. Up to 19353 conditions per place. [2021-06-11 14:30:17,406 INFO L132 encePairwiseOnDemand]: 281/299 looper letters, 325 selfloop transitions, 131 changer transitions 97/585 dead transitions. [2021-06-11 14:30:17,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 585 transitions, 5605 flow [2021-06-11 14:30:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-11 14:30:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-11 14:30:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2444 transitions. [2021-06-11 14:30:17,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5838509316770186 [2021-06-11 14:30:17,412 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2444 transitions. [2021-06-11 14:30:17,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2444 transitions. [2021-06-11 14:30:17,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:17,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2444 transitions. [2021-06-11 14:30:17,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 174.57142857142858) internal successors, (2444), 14 states have internal predecessors, (2444), 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) [2021-06-11 14:30:17,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 299.0) internal successors, (4485), 15 states have internal predecessors, (4485), 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) [2021-06-11 14:30:17,423 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 299.0) internal successors, (4485), 15 states have internal predecessors, (4485), 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) [2021-06-11 14:30:17,423 INFO L185 Difference]: Start difference. First operand has 114 places, 195 transitions, 1596 flow. Second operand 14 states and 2444 transitions. [2021-06-11 14:30:17,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 585 transitions, 5605 flow [2021-06-11 14:30:21,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 585 transitions, 5543 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-06-11 14:30:21,182 INFO L241 Difference]: Finished difference. Result has 133 places, 272 transitions, 2976 flow [2021-06-11 14:30:21,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2976, PETRI_PLACES=133, PETRI_TRANSITIONS=272} [2021-06-11 14:30:21,183 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 68 predicate places. [2021-06-11 14:30:21,183 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:21,183 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 272 transitions, 2976 flow [2021-06-11 14:30:21,183 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 272 transitions, 2976 flow [2021-06-11 14:30:21,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 272 transitions, 2976 flow [2021-06-11 14:30:21,970 INFO L129 PetriNetUnfolder]: 3504/7877 cut-off events. [2021-06-11 14:30:21,970 INFO L130 PetriNetUnfolder]: For 43044/46099 co-relation queries the response was YES. [2021-06-11 14:30:22,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34259 conditions, 7877 events. 3504/7877 cut-off events. For 43044/46099 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 77456 event pairs, 200 based on Foata normal form. 160/5882 useless extension candidates. Maximal degree in co-relation 33510. Up to 1366 conditions per place. [2021-06-11 14:30:22,120 INFO L151 LiptonReduction]: Number of co-enabled transitions 7486 [2021-06-11 14:30:22,393 INFO L163 LiptonReduction]: Checked pairs total: 2688 [2021-06-11 14:30:22,393 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:22,393 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1210 [2021-06-11 14:30:22,395 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 272 transitions, 2976 flow [2021-06-11 14:30:22,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 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) [2021-06-11 14:30:22,396 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:22,396 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:22,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 14:30:22,396 INFO L428 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:22,396 INFO L82 PathProgramCache]: Analyzing trace with hash 710062862, now seen corresponding path program 1 times [2021-06-11 14:30:22,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:22,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497205914] [2021-06-11 14:30:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:22,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:22,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:22,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:22,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:22,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:22,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:22,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:22,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:22,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497205914] [2021-06-11 14:30:22,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:22,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:30:22,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232921125] [2021-06-11 14:30:22,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 14:30:22,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 14:30:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 14:30:22,454 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 299 [2021-06-11 14:30:22,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 272 transitions, 2976 flow. Second operand has 5 states, 5 states have (on average 217.8) internal successors, (1089), 5 states have internal predecessors, (1089), 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) [2021-06-11 14:30:22,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:22,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 299 [2021-06-11 14:30:22,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:23,712 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][156], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 140#L767-10true, 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,713 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 14:30:23,713 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:23,713 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:23,713 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:23,728 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L767-10-->L771-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_34|))) (and (= (select .cse0 |v_~#mutex~0.offset_34|) 0) (= v_~ctr2~0_337 |v_qrcu_updaterThread1of1ForFork2_#t~post18_37|) (<= v_~idx~0_58 0) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_34| (store .cse0 |v_~#mutex~0.offset_34| 1))) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_133))) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_37|, #pthreadsMutex=|v_#pthreadsMutex_27|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post18, #pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][228], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 97#L771-2true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,728 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,728 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,728 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,728 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,729 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L767-10-->L772-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#mutex~0.base_36|))) (and (not (<= v_~idx~0_60 0)) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#mutex~0.base_36| (store .cse0 |v_~#mutex~0.offset_36| 1))) (= v_~ctr1~0_327 |v_qrcu_updaterThread1of1ForFork2_#t~post20_29|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_135) (= (select .cse0 |v_~#mutex~0.offset_36|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~post20=|v_qrcu_updaterThread1of1ForFork2_#t~post20_29|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_17|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~post20, qrcu_updaterThread1of1ForFork2_#t~nondet17][229], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 35#L772-1true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,729 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,729 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,729 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,729 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:23,863 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][156], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 140#L767-10true, 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,863 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 14:30:23,863 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:23,863 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:23,863 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:23,876 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L767-10-->L771-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_34|))) (and (= (select .cse0 |v_~#mutex~0.offset_34|) 0) (= v_~ctr2~0_337 |v_qrcu_updaterThread1of1ForFork2_#t~post18_37|) (<= v_~idx~0_58 0) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_34| (store .cse0 |v_~#mutex~0.offset_34| 1))) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_133))) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_37|, #pthreadsMutex=|v_#pthreadsMutex_27|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post18, #pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][228], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 97#L771-2true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,877 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L767-10-->L772-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#mutex~0.base_36|))) (and (not (<= v_~idx~0_60 0)) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#mutex~0.base_36| (store .cse0 |v_~#mutex~0.offset_36| 1))) (= v_~ctr1~0_327 |v_qrcu_updaterThread1of1ForFork2_#t~post20_29|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_135) (= (select .cse0 |v_~#mutex~0.offset_36|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~post20=|v_qrcu_updaterThread1of1ForFork2_#t~post20_29|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_17|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~post20, qrcu_updaterThread1of1ForFork2_#t~nondet17][229], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 35#L772-1true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true]) [2021-06-11 14:30:23,877 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:23,877 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:24,339 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L767-10-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_13| (select (select |v_#memory_int_63| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|)) (not (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~mem22][187], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 204#true, Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 51#L788-1true, 307#(= ~readerprogress1~0 2), 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 186#(= ~readerprogress1~0 0), 189#true, 62#L777true]) [2021-06-11 14:30:24,340 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-06-11 14:30:24,340 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-06-11 14:30:24,340 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-06-11 14:30:24,340 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-06-11 14:30:24,577 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][13], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 171#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,578 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][14], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 146#L727true, 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,578 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][15], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 169#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,578 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,578 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][16], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 165#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,579 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][17], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 38#L725-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,579 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][18], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 109#L732true, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,579 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][19], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 166#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,580 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,580 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,580 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:24,580 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][13], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 171#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,603 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][14], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 146#L727true, 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,603 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,603 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][15], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 169#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,604 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][16], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 165#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,604 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][17], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 38#L725-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,604 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,604 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][18], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 109#L732true, Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,604 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][19], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 268#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 166#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 305#true, 116#L787-1true, Black: 181#(= ~readerprogress2~0 0), 189#true]) [2021-06-11 14:30:24,605 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-06-11 14:30:24,605 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:24,657 INFO L129 PetriNetUnfolder]: 8384/17461 cut-off events. [2021-06-11 14:30:24,657 INFO L130 PetriNetUnfolder]: For 104366/113818 co-relation queries the response was YES. [2021-06-11 14:30:24,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75914 conditions, 17461 events. 8384/17461 cut-off events. For 104366/113818 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 180583 event pairs, 1481 based on Foata normal form. 220/13547 useless extension candidates. Maximal degree in co-relation 73203. Up to 2957 conditions per place. [2021-06-11 14:30:24,815 INFO L132 encePairwiseOnDemand]: 291/299 looper letters, 49 selfloop transitions, 7 changer transitions 0/300 dead transitions. [2021-06-11 14:30:24,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 300 transitions, 3246 flow [2021-06-11 14:30:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 14:30:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 14:30:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1121 transitions. [2021-06-11 14:30:24,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7498327759197324 [2021-06-11 14:30:24,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1121 transitions. [2021-06-11 14:30:24,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1121 transitions. [2021-06-11 14:30:24,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:24,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1121 transitions. [2021-06-11 14:30:24,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.2) internal successors, (1121), 5 states have internal predecessors, (1121), 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) [2021-06-11 14:30:24,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 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) [2021-06-11 14:30:24,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 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) [2021-06-11 14:30:24,822 INFO L185 Difference]: Start difference. First operand has 133 places, 272 transitions, 2976 flow. Second operand 5 states and 1121 transitions. [2021-06-11 14:30:24,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 300 transitions, 3246 flow [2021-06-11 14:30:25,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 300 transitions, 3006 flow, removed 44 selfloop flow, removed 3 redundant places. [2021-06-11 14:30:25,816 INFO L241 Difference]: Finished difference. Result has 137 places, 278 transitions, 2827 flow [2021-06-11 14:30:25,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2827, PETRI_PLACES=137, PETRI_TRANSITIONS=278} [2021-06-11 14:30:25,816 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 72 predicate places. [2021-06-11 14:30:25,816 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:25,816 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 278 transitions, 2827 flow [2021-06-11 14:30:25,816 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 278 transitions, 2827 flow [2021-06-11 14:30:25,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 278 transitions, 2827 flow [2021-06-11 14:30:26,470 INFO L129 PetriNetUnfolder]: 3922/8626 cut-off events. [2021-06-11 14:30:26,470 INFO L130 PetriNetUnfolder]: For 44021/47626 co-relation queries the response was YES. [2021-06-11 14:30:26,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36166 conditions, 8626 events. 3922/8626 cut-off events. For 44021/47626 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 83785 event pairs, 208 based on Foata normal form. 187/6468 useless extension candidates. Maximal degree in co-relation 35406. Up to 1626 conditions per place. [2021-06-11 14:30:26,579 INFO L151 LiptonReduction]: Number of co-enabled transitions 7684 [2021-06-11 14:30:26,676 INFO L142 QuantifierPusher]: treesize reduction 9, result has 97.8 percent of original size [2021-06-11 14:30:26,689 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:30:28,138 INFO L163 LiptonReduction]: Checked pairs total: 3924 [2021-06-11 14:30:28,138 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 14:30:28,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2322 [2021-06-11 14:30:28,138 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 278 transitions, 2833 flow [2021-06-11 14:30:28,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 217.8) internal successors, (1089), 5 states have internal predecessors, (1089), 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) [2021-06-11 14:30:28,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:28,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 14:30:28,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 14:30:28,139 INFO L428 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -60954908, now seen corresponding path program 1 times [2021-06-11 14:30:28,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:28,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336667964] [2021-06-11 14:30:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:28,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:28,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:28,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:28,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:28,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:28,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:28,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336667964] [2021-06-11 14:30:28,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:28,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 14:30:28,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753857737] [2021-06-11 14:30:28,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 14:30:28,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 14:30:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 14:30:28,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 301 [2021-06-11 14:30:28,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 278 transitions, 2833 flow. Second operand has 4 states, 4 states have (on average 223.25) internal successors, (893), 4 states have internal predecessors, (893), 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) [2021-06-11 14:30:28,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:28,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 301 [2021-06-11 14:30:28,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:29,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][156], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 318#true]) [2021-06-11 14:30:29,416 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-06-11 14:30:29,416 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:29,417 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:29,417 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-06-11 14:30:29,427 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L767-10-->L771-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_34|))) (and (= (select .cse0 |v_~#mutex~0.offset_34|) 0) (= v_~ctr2~0_337 |v_qrcu_updaterThread1of1ForFork2_#t~post18_37|) (<= v_~idx~0_58 0) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_34| (store .cse0 |v_~#mutex~0.offset_34| 1))) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_133))) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_37|, #pthreadsMutex=|v_#pthreadsMutex_27|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post18, #pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][229], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 97#L771-2true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 318#true]) [2021-06-11 14:30:29,427 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,427 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,427 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,427 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,427 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L767-10-->L772-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#mutex~0.base_36|))) (and (not (<= v_~idx~0_60 0)) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#mutex~0.base_36| (store .cse0 |v_~#mutex~0.offset_36| 1))) (= v_~ctr1~0_327 |v_qrcu_updaterThread1of1ForFork2_#t~post20_29|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_135) (= (select .cse0 |v_~#mutex~0.offset_36|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~post20=|v_qrcu_updaterThread1of1ForFork2_#t~post20_29|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_17|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~post20, qrcu_updaterThread1of1ForFork2_#t~nondet17][230], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 35#L772-1true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 318#true]) [2021-06-11 14:30:29,428 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,428 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,428 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,428 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:30:29,576 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][156], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 318#true]) [2021-06-11 14:30:29,577 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 14:30:29,577 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:29,577 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:29,577 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 14:30:29,587 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([965] L767-10-->L771-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_34|))) (and (= (select .cse0 |v_~#mutex~0.offset_34|) 0) (= v_~ctr2~0_337 |v_qrcu_updaterThread1of1ForFork2_#t~post18_37|) (<= v_~idx~0_58 0) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_34| (store .cse0 |v_~#mutex~0.offset_34| 1))) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_133))) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_37|, #pthreadsMutex=|v_#pthreadsMutex_27|, ~#mutex~0.base=|v_~#mutex~0.base_34|, ~idx~0=v_~idx~0_58, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_133, ~ctr2~0=v_~ctr2~0_337} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post18, #pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][229], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 97#L771-2true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 318#true]) [2021-06-11 14:30:29,588 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([966] L767-10-->L772-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| |v_~#mutex~0.base_36|))) (and (not (<= v_~idx~0_60 0)) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#mutex~0.base_36| (store .cse0 |v_~#mutex~0.offset_36| 1))) (= v_~ctr1~0_327 |v_qrcu_updaterThread1of1ForFork2_#t~post20_29|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_135) (= (select .cse0 |v_~#mutex~0.offset_36|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#mutex~0.base=|v_~#mutex~0.base_36|, ~idx~0=v_~idx~0_60, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~post20=|v_qrcu_updaterThread1of1ForFork2_#t~post20_29|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_17|, ~ctr1~0=v_~ctr1~0_327, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_135} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~post20, qrcu_updaterThread1of1ForFork2_#t~nondet17][230], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 35#L772-1true, 100#qrcu_reader1EXITtrue, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 45#L744-3true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), 116#L787-1true, Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 318#true]) [2021-06-11 14:30:29,588 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:29,588 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:30:30,027 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L767-10-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_13| (select (select |v_#memory_int_63| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|)) (not (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~mem22][142], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 204#true, Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 51#L788-1true, 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 62#L777true, 318#true]) [2021-06-11 14:30:30,027 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:30,028 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:30,028 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:30,028 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:30,629 INFO L129 PetriNetUnfolder]: 9791/20606 cut-off events. [2021-06-11 14:30:30,629 INFO L130 PetriNetUnfolder]: For 97943/104625 co-relation queries the response was YES. [2021-06-11 14:30:30,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85325 conditions, 20606 events. 9791/20606 cut-off events. For 97943/104625 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 216619 event pairs, 1503 based on Foata normal form. 417/16650 useless extension candidates. Maximal degree in co-relation 82585. Up to 3262 conditions per place. [2021-06-11 14:30:30,819 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 59 selfloop transitions, 5 changer transitions 0/309 dead transitions. [2021-06-11 14:30:30,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 309 transitions, 3213 flow [2021-06-11 14:30:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 14:30:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 14:30:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2021-06-11 14:30:30,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7624584717607974 [2021-06-11 14:30:30,821 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 918 transitions. [2021-06-11 14:30:30,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 918 transitions. [2021-06-11 14:30:30,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:30,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 918 transitions. [2021-06-11 14:30:30,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 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) [2021-06-11 14:30:30,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 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) [2021-06-11 14:30:30,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 301.0) internal successors, (1505), 5 states have internal predecessors, (1505), 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) [2021-06-11 14:30:30,825 INFO L185 Difference]: Start difference. First operand has 137 places, 278 transitions, 2833 flow. Second operand 4 states and 918 transitions. [2021-06-11 14:30:30,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 309 transitions, 3213 flow [2021-06-11 14:30:31,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 309 transitions, 3160 flow, removed 25 selfloop flow, removed 1 redundant places. [2021-06-11 14:30:31,923 INFO L241 Difference]: Finished difference. Result has 141 places, 282 transitions, 2875 flow [2021-06-11 14:30:31,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=2810, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2875, PETRI_PLACES=141, PETRI_TRANSITIONS=282} [2021-06-11 14:30:31,923 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 76 predicate places. [2021-06-11 14:30:31,924 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:31,924 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 282 transitions, 2875 flow [2021-06-11 14:30:31,940 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 282 transitions, 2875 flow [2021-06-11 14:30:31,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 282 transitions, 2875 flow [2021-06-11 14:30:32,625 INFO L129 PetriNetUnfolder]: 4339/9761 cut-off events. [2021-06-11 14:30:32,625 INFO L130 PetriNetUnfolder]: For 47145/50830 co-relation queries the response was YES. [2021-06-11 14:30:32,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39849 conditions, 9761 events. 4339/9761 cut-off events. For 47145/50830 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 97492 event pairs, 231 based on Foata normal form. 207/7498 useless extension candidates. Maximal degree in co-relation 38859. Up to 1778 conditions per place. [2021-06-11 14:30:32,756 INFO L151 LiptonReduction]: Number of co-enabled transitions 7732 [2021-06-11 14:30:32,957 INFO L142 QuantifierPusher]: treesize reduction 9, result has 97.8 percent of original size [2021-06-11 14:30:32,971 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:30:33,615 INFO L163 LiptonReduction]: Checked pairs total: 1928 [2021-06-11 14:30:33,615 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 14:30:33,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1692 [2021-06-11 14:30:33,616 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 282 transitions, 2881 flow [2021-06-11 14:30:33,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 223.25) internal successors, (893), 4 states have internal predecessors, (893), 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) [2021-06-11 14:30:33,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:33,617 INFO L263 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] [2021-06-11 14:30:33,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 14:30:33,617 INFO L428 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash 990239404, now seen corresponding path program 1 times [2021-06-11 14:30:33,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:33,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495331408] [2021-06-11 14:30:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:33,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:33,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:33,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:33,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:33,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:33,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:33,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:33,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:33,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495331408] [2021-06-11 14:30:33,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:33,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:30:33,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494620265] [2021-06-11 14:30:33,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 14:30:33,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 14:30:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 14:30:33,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 303 [2021-06-11 14:30:33,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 282 transitions, 2881 flow. Second operand has 5 states, 5 states have (on average 245.4) internal successors, (1227), 5 states have internal predecessors, (1227), 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) [2021-06-11 14:30:33,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:33,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 303 [2021-06-11 14:30:33,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:35,358 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([861] qrcu_reader2EXIT-->L788-2: Formula: (= v_qrcu_reader2Thread1of1ForFork1_thidvar0_6 |v_ULTIMATE.start_main_#t~mem28_7|) InVars {qrcu_reader2Thread1of1ForFork1_thidvar0=v_qrcu_reader2Thread1of1ForFork1_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_7|} OutVars{qrcu_reader2Thread1of1ForFork1_thidvar0=v_qrcu_reader2Thread1of1ForFork1_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_7|} AuxVars[] AssignedVars[][279], [320#(= ~readerprogress2~0 2), Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 95#L738true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 54#L788-2true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true]) [2021-06-11 14:30:35,358 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-06-11 14:30:35,358 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-06-11 14:30:35,358 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-06-11 14:30:35,358 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-06-11 14:30:35,360 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([862] qrcu_updaterEXIT-->L788-2: Formula: (= v_qrcu_updaterThread1of1ForFork2_thidvar0_6 |v_ULTIMATE.start_main_#t~mem28_9|) InVars {qrcu_updaterThread1of1ForFork2_thidvar0=v_qrcu_updaterThread1of1ForFork2_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_9|} OutVars{qrcu_updaterThread1of1ForFork2_thidvar0=v_qrcu_updaterThread1of1ForFork2_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_9|} AuxVars[] AssignedVars[][294], [320#(= ~readerprogress2~0 2), Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 95#L738true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 173#true, 54#L788-2true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true]) [2021-06-11 14:30:35,360 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-06-11 14:30:35,360 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-06-11 14:30:35,360 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-06-11 14:30:35,360 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-06-11 14:30:35,362 INFO L129 PetriNetUnfolder]: 5613/13254 cut-off events. [2021-06-11 14:30:35,362 INFO L130 PetriNetUnfolder]: For 91007/98703 co-relation queries the response was YES. [2021-06-11 14:30:35,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54724 conditions, 13254 events. 5613/13254 cut-off events. For 91007/98703 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 143785 event pairs, 366 based on Foata normal form. 470/11039 useless extension candidates. Maximal degree in co-relation 53210. Up to 2150 conditions per place. [2021-06-11 14:30:35,475 INFO L132 encePairwiseOnDemand]: 288/303 looper letters, 47 selfloop transitions, 49 changer transitions 2/323 dead transitions. [2021-06-11 14:30:35,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 323 transitions, 3420 flow [2021-06-11 14:30:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 14:30:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 14:30:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1770 transitions. [2021-06-11 14:30:35,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8345120226308345 [2021-06-11 14:30:35,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1770 transitions. [2021-06-11 14:30:35,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1770 transitions. [2021-06-11 14:30:35,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:35,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1770 transitions. [2021-06-11 14:30:35,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 252.85714285714286) internal successors, (1770), 7 states have internal predecessors, (1770), 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) [2021-06-11 14:30:35,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 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) [2021-06-11 14:30:35,501 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 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) [2021-06-11 14:30:35,501 INFO L185 Difference]: Start difference. First operand has 141 places, 282 transitions, 2881 flow. Second operand 7 states and 1770 transitions. [2021-06-11 14:30:35,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 323 transitions, 3420 flow [2021-06-11 14:30:35,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 323 transitions, 3411 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-06-11 14:30:35,856 INFO L241 Difference]: Finished difference. Result has 151 places, 298 transitions, 3262 flow [2021-06-11 14:30:35,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2872, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3262, PETRI_PLACES=151, PETRI_TRANSITIONS=298} [2021-06-11 14:30:35,856 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 86 predicate places. [2021-06-11 14:30:35,856 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:35,857 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 298 transitions, 3262 flow [2021-06-11 14:30:35,857 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 298 transitions, 3262 flow [2021-06-11 14:30:35,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 298 transitions, 3262 flow [2021-06-11 14:30:36,664 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,664 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,665 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:36,665 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:36,665 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,671 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,671 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,671 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,671 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,671 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:36,737 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 320#(= ~readerprogress2~0 2), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,737 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,737 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:36,737 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:36,737 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:36,850 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][244], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 171#true, Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,851 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][142], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 146#L727true, 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,851 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][242], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 169#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,851 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,851 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][57], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 165#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,852 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][137], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 38#L725-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,852 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][128], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 109#L732true, 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,852 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,852 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,868 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,868 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,869 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][47], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 166#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:36,869 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:36,869 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,869 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,869 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:36,974 INFO L129 PetriNetUnfolder]: 5419/12541 cut-off events. [2021-06-11 14:30:36,974 INFO L130 PetriNetUnfolder]: For 75125/79788 co-relation queries the response was YES. [2021-06-11 14:30:37,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53947 conditions, 12541 events. 5419/12541 cut-off events. For 75125/79788 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 132422 event pairs, 364 based on Foata normal form. 246/9807 useless extension candidates. Maximal degree in co-relation 52429. Up to 2306 conditions per place. [2021-06-11 14:30:37,347 INFO L151 LiptonReduction]: Number of co-enabled transitions 8390 [2021-06-11 14:30:37,627 INFO L163 LiptonReduction]: Checked pairs total: 921 [2021-06-11 14:30:37,627 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:37,628 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1772 [2021-06-11 14:30:37,628 INFO L480 AbstractCegarLoop]: Abstraction has has 151 places, 298 transitions, 3262 flow [2021-06-11 14:30:37,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 245.4) internal successors, (1227), 5 states have internal predecessors, (1227), 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) [2021-06-11 14:30:37,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:37,629 INFO L263 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] [2021-06-11 14:30:37,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 14:30:37,629 INFO L428 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 990238412, now seen corresponding path program 1 times [2021-06-11 14:30:37,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:37,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267134919] [2021-06-11 14:30:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:37,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:37,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:37,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:37,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 14:30:37,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:37,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:37,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267134919] [2021-06-11 14:30:37,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:37,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 14:30:37,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561410513] [2021-06-11 14:30:37,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 14:30:37,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 14:30:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 14:30:37,651 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 303 [2021-06-11 14:30:37,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 298 transitions, 3262 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:37,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:37,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 303 [2021-06-11 14:30:37,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:39,872 INFO L129 PetriNetUnfolder]: 8917/17192 cut-off events. [2021-06-11 14:30:39,872 INFO L130 PetriNetUnfolder]: For 99232/104687 co-relation queries the response was YES. [2021-06-11 14:30:39,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84360 conditions, 17192 events. 8917/17192 cut-off events. For 99232/104687 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 162899 event pairs, 980 based on Foata normal form. 393/11966 useless extension candidates. Maximal degree in co-relation 82498. Up to 4536 conditions per place. [2021-06-11 14:30:40,042 INFO L132 encePairwiseOnDemand]: 301/303 looper letters, 96 selfloop transitions, 12 changer transitions 2/313 dead transitions. [2021-06-11 14:30:40,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 313 transitions, 3634 flow [2021-06-11 14:30:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 14:30:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 14:30:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2021-06-11 14:30:40,044 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8657865786578658 [2021-06-11 14:30:40,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2021-06-11 14:30:40,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2021-06-11 14:30:40,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:40,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2021-06-11 14:30:40,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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) [2021-06-11 14:30:40,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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) [2021-06-11 14:30:40,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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) [2021-06-11 14:30:40,048 INFO L185 Difference]: Start difference. First operand has 151 places, 298 transitions, 3262 flow. Second operand 3 states and 787 transitions. [2021-06-11 14:30:40,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 313 transitions, 3634 flow [2021-06-11 14:30:40,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 313 transitions, 3608 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-06-11 14:30:40,864 INFO L241 Difference]: Finished difference. Result has 154 places, 296 transitions, 3250 flow [2021-06-11 14:30:40,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3236, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3250, PETRI_PLACES=154, PETRI_TRANSITIONS=296} [2021-06-11 14:30:40,864 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 89 predicate places. [2021-06-11 14:30:40,864 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:40,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 296 transitions, 3250 flow [2021-06-11 14:30:40,865 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 296 transitions, 3250 flow [2021-06-11 14:30:40,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 296 transitions, 3250 flow [2021-06-11 14:30:41,641 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([903] L771-6-->L771-9: Formula: (= v_~ctr1~0_172 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post19_12| (- 1))) InVars {qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_12|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_11|, ~ctr1~0=v_~ctr1~0_172} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post19, ~ctr1~0][97], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 39#L725-3true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 71#L771-9true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 331#(<= 1 ~ctr2~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 327#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,641 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,642 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,642 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,642 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,650 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,651 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,651 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,651 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,651 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,660 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 344#(= ~idx~0 1), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,661 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,661 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,661 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,661 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,711 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([903] L771-6-->L771-9: Formula: (= v_~ctr1~0_172 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post19_12| (- 1))) InVars {qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_12|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_11|, ~ctr1~0=v_~ctr1~0_172} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post19, ~ctr1~0][97], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 39#L725-3true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 71#L771-9true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 331#(<= 1 ~ctr2~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 327#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,711 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,711 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,711 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,712 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,712 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,740 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][173], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 320#(= ~readerprogress2~0 2), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,740 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,741 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,741 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,741 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:41,784 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([954] L739-->qrcu_reader1EXIT: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#res.offset_17| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|) (= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|) (let ((.cse0 (<= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43 0))) (or (and (= (+ v_~ctr1~0_305 1) v_~ctr1~0_306) (= v_~ctr2~0_320 v_~ctr2~0_319) .cse0 (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_43| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_69|)) (and (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_43| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_69|) (= v_~ctr1~0_306 v_~ctr1~0_305) (= v_~ctr2~0_320 (+ v_~ctr2~0_319 1)) (not .cse0)))) (= |v_qrcu_reader1Thread1of1ForFork0_#res.base_17| 0)) InVars {~ctr1~0=v_~ctr1~0_306, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101, ~ctr2~0=v_~ctr2~0_320} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_43|, qrcu_reader1Thread1of1ForFork0_#res.offset=|v_qrcu_reader1Thread1of1ForFork0_#res.offset_17|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_43, ~ctr1~0=v_~ctr1~0_305, qrcu_reader1Thread1of1ForFork0_#res.base=|v_qrcu_reader1Thread1of1ForFork0_#res.base_17|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_101, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_43|, ~ctr2~0=v_~ctr2~0_319, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_43|} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_69|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_69|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8, qrcu_reader1Thread1of1ForFork0_#res.offset, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx, ~ctr1~0, qrcu_reader1Thread1of1ForFork0_#res.base, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7][238], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), 89#L771-5true, Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,784 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,784 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,784 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,785 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:41,884 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][236], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 171#true, Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,885 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][144], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 146#L727true, 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,885 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][235], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 169#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,885 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,885 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][57], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 165#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,886 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][135], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 38#L725-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,886 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,886 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][127], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 109#L732true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,887 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][46], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 166#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 342#true, Black: 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:41,887 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:41,887 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-06-11 14:30:42,002 INFO L129 PetriNetUnfolder]: 5301/12451 cut-off events. [2021-06-11 14:30:42,002 INFO L130 PetriNetUnfolder]: For 76594/81642 co-relation queries the response was YES. [2021-06-11 14:30:42,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54311 conditions, 12451 events. 5301/12451 cut-off events. For 76594/81642 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 131781 event pairs, 343 based on Foata normal form. 254/9982 useless extension candidates. Maximal degree in co-relation 52791. Up to 2327 conditions per place. [2021-06-11 14:30:42,306 INFO L151 LiptonReduction]: Number of co-enabled transitions 8332 [2021-06-11 14:30:42,783 INFO L163 LiptonReduction]: Checked pairs total: 903 [2021-06-11 14:30:42,783 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:42,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1919 [2021-06-11 14:30:42,784 INFO L480 AbstractCegarLoop]: Abstraction has has 154 places, 296 transitions, 3250 flow [2021-06-11 14:30:42,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:42,784 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:42,784 INFO L263 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] [2021-06-11 14:30:42,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 14:30:42,784 INFO L428 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:42,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:42,784 INFO L82 PathProgramCache]: Analyzing trace with hash -356599175, now seen corresponding path program 1 times [2021-06-11 14:30:42,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:42,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342418089] [2021-06-11 14:30:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:42,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:42,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:30:42,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:42,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:42,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342418089] [2021-06-11 14:30:42,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:42,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 14:30:42,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902766518] [2021-06-11 14:30:42,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 14:30:42,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:42,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 14:30:42,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 14:30:42,809 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 303 [2021-06-11 14:30:42,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 296 transitions, 3250 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:42,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:42,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 303 [2021-06-11 14:30:42,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:44,128 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][136], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 171#true, Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,128 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][137], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 146#L727true, 21#L786-2true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,128 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,128 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][138], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 169#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,129 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][139], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 165#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 347#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,129 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][140], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 38#L725-2true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 347#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,129 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:44,129 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:44,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][141], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 109#L732true, Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,130 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][142], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 166#true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), 73#L774-2true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:44,130 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,130 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,131 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-06-11 14:30:44,196 INFO L129 PetriNetUnfolder]: 6926/13444 cut-off events. [2021-06-11 14:30:44,196 INFO L130 PetriNetUnfolder]: For 81927/86682 co-relation queries the response was YES. [2021-06-11 14:30:44,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67899 conditions, 13444 events. 6926/13444 cut-off events. For 81927/86682 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 124901 event pairs, 759 based on Foata normal form. 512/9408 useless extension candidates. Maximal degree in co-relation 66611. Up to 3022 conditions per place. [2021-06-11 14:30:44,313 INFO L132 encePairwiseOnDemand]: 300/303 looper letters, 87 selfloop transitions, 13 changer transitions 0/286 dead transitions. [2021-06-11 14:30:44,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 286 transitions, 3424 flow [2021-06-11 14:30:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 14:30:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 14:30:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2021-06-11 14:30:44,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8613861386138614 [2021-06-11 14:30:44,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 783 transitions. [2021-06-11 14:30:44,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 783 transitions. [2021-06-11 14:30:44,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:44,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 783 transitions. [2021-06-11 14:30:44,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:44,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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) [2021-06-11 14:30:44,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 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) [2021-06-11 14:30:44,318 INFO L185 Difference]: Start difference. First operand has 154 places, 296 transitions, 3250 flow. Second operand 3 states and 783 transitions. [2021-06-11 14:30:44,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 286 transitions, 3424 flow [2021-06-11 14:30:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 286 transitions, 3346 flow, removed 27 selfloop flow, removed 3 redundant places. [2021-06-11 14:30:44,903 INFO L241 Difference]: Finished difference. Result has 147 places, 272 transitions, 3018 flow [2021-06-11 14:30:44,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2992, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3018, PETRI_PLACES=147, PETRI_TRANSITIONS=272} [2021-06-11 14:30:44,904 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 82 predicate places. [2021-06-11 14:30:44,904 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:44,904 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 272 transitions, 3018 flow [2021-06-11 14:30:44,904 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 272 transitions, 3018 flow [2021-06-11 14:30:44,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 272 transitions, 3018 flow [2021-06-11 14:30:45,820 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][163], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 349#(= ~idx~0 0), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 110#qrcu_reader2EXITtrue, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:45,820 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,820 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:45,820 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:45,820 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,826 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][163], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, 349#(= ~idx~0 0), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:45,828 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,828 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:45,828 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,828 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([903] L771-6-->L771-9: Formula: (= v_~ctr1~0_172 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post19_12| (- 1))) InVars {qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_12|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post19=|v_qrcu_updaterThread1of1ForFork2_#t~post19_11|, ~ctr1~0=v_~ctr1~0_172} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~post19, ~ctr1~0][91], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 39#L725-3true, Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 71#L771-9true, Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 331#(<= 1 ~ctr2~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 327#true, 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 344#(= ~idx~0 1), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 347#true, Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:45,858 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,858 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,859 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,859 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,880 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][163], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 21#L786-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 320#(= ~readerprogress2~0 2), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, 349#(= ~idx~0 0), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 99#L771-3true, 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:30:45,880 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,880 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 14:30:45,880 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:45,881 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 14:30:45,990 INFO L129 PetriNetUnfolder]: 3987/9443 cut-off events. [2021-06-11 14:30:45,991 INFO L130 PetriNetUnfolder]: For 53526/57495 co-relation queries the response was YES. [2021-06-11 14:30:46,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42843 conditions, 9443 events. 3987/9443 cut-off events. For 53526/57495 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 97426 event pairs, 193 based on Foata normal form. 193/7362 useless extension candidates. Maximal degree in co-relation 41656. Up to 1849 conditions per place. [2021-06-11 14:30:46,401 INFO L151 LiptonReduction]: Number of co-enabled transitions 7178 [2021-06-11 14:30:46,961 INFO L163 LiptonReduction]: Checked pairs total: 657 [2021-06-11 14:30:46,961 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:30:46,961 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2057 [2021-06-11 14:30:46,962 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 272 transitions, 3018 flow [2021-06-11 14:30:46,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 14:30:46,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:46,962 INFO L263 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] [2021-06-11 14:30:46,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 14:30:46,962 INFO L428 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 964451628, now seen corresponding path program 1 times [2021-06-11 14:30:46,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:46,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734822981] [2021-06-11 14:30:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:47,009 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:30:47,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:47,014 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:30:47,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:47,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:47,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:47,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:47,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:47,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:30:47,050 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:30:47,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:47,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:47,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:47,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734822981] [2021-06-11 14:30:47,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:47,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 14:30:47,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337889448] [2021-06-11 14:30:47,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 14:30:47,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 14:30:47,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-11 14:30:47,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 303 [2021-06-11 14:30:47,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 272 transitions, 3018 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:30:47,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:47,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 303 [2021-06-11 14:30:47,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:50,447 INFO L129 PetriNetUnfolder]: 17846/28037 cut-off events. [2021-06-11 14:30:50,447 INFO L130 PetriNetUnfolder]: For 121582/122519 co-relation queries the response was YES. [2021-06-11 14:30:50,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152361 conditions, 28037 events. 17846/28037 cut-off events. For 121582/122519 co-relation queries the response was YES. Maximal size of possible extension queue 1673. Compared 217423 event pairs, 1364 based on Foata normal form. 503/17563 useless extension candidates. Maximal degree in co-relation 150550. Up to 11470 conditions per place. [2021-06-11 14:30:50,696 INFO L132 encePairwiseOnDemand]: 285/303 looper letters, 299 selfloop transitions, 144 changer transitions 92/560 dead transitions. [2021-06-11 14:30:50,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 560 transitions, 6744 flow [2021-06-11 14:30:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 14:30:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 14:30:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2549 transitions. [2021-06-11 14:30:50,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6471185580096471 [2021-06-11 14:30:50,700 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2549 transitions. [2021-06-11 14:30:50,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2549 transitions. [2021-06-11 14:30:50,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:50,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2549 transitions. [2021-06-11 14:30:50,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 196.07692307692307) internal successors, (2549), 13 states have internal predecessors, (2549), 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) [2021-06-11 14:30:50,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 303.0) internal successors, (4242), 14 states have internal predecessors, (4242), 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) [2021-06-11 14:30:50,708 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 303.0) internal successors, (4242), 14 states have internal predecessors, (4242), 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) [2021-06-11 14:30:50,708 INFO L185 Difference]: Start difference. First operand has 147 places, 272 transitions, 3018 flow. Second operand 13 states and 2549 transitions. [2021-06-11 14:30:50,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 560 transitions, 6744 flow [2021-06-11 14:30:52,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 560 transitions, 6718 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 14:30:52,701 INFO L241 Difference]: Finished difference. Result has 161 places, 316 transitions, 4138 flow [2021-06-11 14:30:52,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2992, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4138, PETRI_PLACES=161, PETRI_TRANSITIONS=316} [2021-06-11 14:30:52,701 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 96 predicate places. [2021-06-11 14:30:52,702 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:30:52,702 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 316 transitions, 4138 flow [2021-06-11 14:30:52,702 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 316 transitions, 4138 flow [2021-06-11 14:30:52,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 316 transitions, 4138 flow [2021-06-11 14:30:53,535 INFO L129 PetriNetUnfolder]: 4575/9173 cut-off events. [2021-06-11 14:30:53,535 INFO L130 PetriNetUnfolder]: For 85317/92158 co-relation queries the response was YES. [2021-06-11 14:30:53,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52744 conditions, 9173 events. 4575/9173 cut-off events. For 85317/92158 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 84898 event pairs, 628 based on Foata normal form. 230/6456 useless extension candidates. Maximal degree in co-relation 51778. Up to 2653 conditions per place. [2021-06-11 14:30:53,681 INFO L151 LiptonReduction]: Number of co-enabled transitions 6976 [2021-06-11 14:30:54,148 INFO L142 QuantifierPusher]: treesize reduction 21, result has 97.8 percent of original size [2021-06-11 14:30:54,175 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:30:55,409 INFO L163 LiptonReduction]: Checked pairs total: 1302 [2021-06-11 14:30:55,410 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 14:30:55,410 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2708 [2021-06-11 14:30:55,410 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 316 transitions, 4140 flow [2021-06-11 14:30:55,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:30:55,411 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:30:55,411 INFO L263 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] [2021-06-11 14:30:55,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 14:30:55,411 INFO L428 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:30:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:30:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1869886506, now seen corresponding path program 2 times [2021-06-11 14:30:55,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:30:55,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559145511] [2021-06-11 14:30:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:30:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:30:55,432 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:30:55,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:55,437 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:30:55,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:55,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:30:55,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:55,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:55,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:30:55,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:30:55,476 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:30:55,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:55,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:30:55,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:30:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:30:55,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559145511] [2021-06-11 14:30:55,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:30:55,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 14:30:55,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005368152] [2021-06-11 14:30:55,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 14:30:55,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:30:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 14:30:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-11 14:30:55,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 304 [2021-06-11 14:30:55,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 316 transitions, 4140 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:30:55,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:30:55,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 304 [2021-06-11 14:30:55,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:30:59,064 INFO L129 PetriNetUnfolder]: 16048/25828 cut-off events. [2021-06-11 14:30:59,064 INFO L130 PetriNetUnfolder]: For 154252/155236 co-relation queries the response was YES. [2021-06-11 14:30:59,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158129 conditions, 25828 events. 16048/25828 cut-off events. For 154252/155236 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 203723 event pairs, 2344 based on Foata normal form. 446/16771 useless extension candidates. Maximal degree in co-relation 156513. Up to 9299 conditions per place. [2021-06-11 14:30:59,279 INFO L132 encePairwiseOnDemand]: 285/304 looper letters, 211 selfloop transitions, 114 changer transitions 167/517 dead transitions. [2021-06-11 14:30:59,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 517 transitions, 7189 flow [2021-06-11 14:30:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-11 14:30:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-11 14:30:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2364 transitions. [2021-06-11 14:30:59,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6480263157894737 [2021-06-11 14:30:59,282 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2364 transitions. [2021-06-11 14:30:59,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2364 transitions. [2021-06-11 14:30:59,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:30:59,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2364 transitions. [2021-06-11 14:30:59,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 197.0) internal successors, (2364), 12 states have internal predecessors, (2364), 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) [2021-06-11 14:30:59,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 304.0) internal successors, (3952), 13 states have internal predecessors, (3952), 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) [2021-06-11 14:30:59,289 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 304.0) internal successors, (3952), 13 states have internal predecessors, (3952), 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) [2021-06-11 14:30:59,289 INFO L185 Difference]: Start difference. First operand has 161 places, 316 transitions, 4140 flow. Second operand 12 states and 2364 transitions. [2021-06-11 14:30:59,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 517 transitions, 7189 flow [2021-06-11 14:31:02,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 517 transitions, 6934 flow, removed 97 selfloop flow, removed 2 redundant places. [2021-06-11 14:31:02,035 INFO L241 Difference]: Finished difference. Result has 174 places, 224 transitions, 3072 flow [2021-06-11 14:31:02,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=3895, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3072, PETRI_PLACES=174, PETRI_TRANSITIONS=224} [2021-06-11 14:31:02,036 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 109 predicate places. [2021-06-11 14:31:02,036 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:02,036 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 224 transitions, 3072 flow [2021-06-11 14:31:02,036 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 224 transitions, 3072 flow [2021-06-11 14:31:02,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 224 transitions, 3072 flow [2021-06-11 14:31:02,570 INFO L129 PetriNetUnfolder]: 2903/6198 cut-off events. [2021-06-11 14:31:02,570 INFO L130 PetriNetUnfolder]: For 69194/73812 co-relation queries the response was YES. [2021-06-11 14:31:02,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37915 conditions, 6198 events. 2903/6198 cut-off events. For 69194/73812 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 56135 event pairs, 547 based on Foata normal form. 246/4601 useless extension candidates. Maximal degree in co-relation 36991. Up to 1950 conditions per place. [2021-06-11 14:31:02,676 INFO L151 LiptonReduction]: Number of co-enabled transitions 5188 [2021-06-11 14:31:02,833 INFO L142 QuantifierPusher]: treesize reduction 17, result has 97.8 percent of original size [2021-06-11 14:31:02,850 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:31:03,039 INFO L163 LiptonReduction]: Checked pairs total: 179 [2021-06-11 14:31:03,039 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 14:31:03,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1003 [2021-06-11 14:31:03,040 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 224 transitions, 3074 flow [2021-06-11 14:31:03,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:31:03,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:03,040 INFO L263 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] [2021-06-11 14:31:03,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 14:31:03,040 INFO L428 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash 626065172, now seen corresponding path program 1 times [2021-06-11 14:31:03,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:03,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781821555] [2021-06-11 14:31:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:03,060 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:03,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:03,070 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:03,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:03,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:03,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:03,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 14:31:03,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-06-11 14:31:03,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:03,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:03,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:03,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781821555] [2021-06-11 14:31:03,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:03,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991074049] [2021-06-11 14:31:03,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:03,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:03,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 305 [2021-06-11 14:31:03,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 224 transitions, 3074 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:03,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:03,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 305 [2021-06-11 14:31:03,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:05,447 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L725-2-->L732: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483647) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117 v_~idx~0_69) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80| 0) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 2147483648)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36| 0))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_36|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_80|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_35|, ~idx~0=v_~idx~0_69, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_79|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_117} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][123], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 109#L732true, Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,447 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([967] L725-2-->L728: Formula: (and (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483647) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 0)) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66| 2147483648)) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109 v_~idx~0_62)) InVars {~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_66|} OutVars{~idx~0=v_~idx~0_62, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_65|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_109} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][124], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 166#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,447 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,447 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][125], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), 171#true, Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,448 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][126], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 146#L727true, 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,448 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([893] L725-2-->L727: Formula: (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35 v_~idx~0_15) InVars {~idx~0=v_~idx~0_15} OutVars{~idx~0=v_~idx~0_15, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_35} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_~myidx~0][127], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 169#true, Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,448 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([972] L725-2-->L731: Formula: (and (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119 v_~idx~0_71) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84| 0)) InVars {~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_84|} OutVars{~idx~0=v_~idx~0_71, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_83|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_119} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][128], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 165#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,449 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([970] L725-2-->L725-2: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115 v_~idx~0_67) (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76| 0)) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_32|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_76|} OutVars{qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_31|, ~idx~0=v_~idx~0_67, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_75|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_115} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0_#t~nondet11, qrcu_reader1Thread1of1ForFork0_~myidx~0][129], [Black: 257#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 253#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 255#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 38#L725-2true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 290#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 280#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 282#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 195#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~ctr1~0 1)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 204#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 222#true, 351#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 110#qrcu_reader2EXITtrue, Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 376#true]) [2021-06-11 14:31:05,449 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:31:05,449 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:31:05,887 INFO L129 PetriNetUnfolder]: 11626/19994 cut-off events. [2021-06-11 14:31:05,887 INFO L130 PetriNetUnfolder]: For 165963/166910 co-relation queries the response was YES. [2021-06-11 14:31:05,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128767 conditions, 19994 events. 11626/19994 cut-off events. For 165963/166910 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 167219 event pairs, 1479 based on Foata normal form. 618/13856 useless extension candidates. Maximal degree in co-relation 126844. Up to 6434 conditions per place. [2021-06-11 14:31:06,054 INFO L132 encePairwiseOnDemand]: 282/305 looper letters, 272 selfloop transitions, 149 changer transitions 30/476 dead transitions. [2021-06-11 14:31:06,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 476 transitions, 7029 flow [2021-06-11 14:31:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-11 14:31:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-11 14:31:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2377 transitions. [2021-06-11 14:31:06,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6494535519125683 [2021-06-11 14:31:06,058 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2377 transitions. [2021-06-11 14:31:06,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2377 transitions. [2021-06-11 14:31:06,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:06,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2377 transitions. [2021-06-11 14:31:06,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 198.08333333333334) internal successors, (2377), 12 states have internal predecessors, (2377), 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) [2021-06-11 14:31:06,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 305.0) internal successors, (3965), 13 states have internal predecessors, (3965), 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) [2021-06-11 14:31:06,064 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 305.0) internal successors, (3965), 13 states have internal predecessors, (3965), 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) [2021-06-11 14:31:06,064 INFO L185 Difference]: Start difference. First operand has 166 places, 224 transitions, 3074 flow. Second operand 12 states and 2377 transitions. [2021-06-11 14:31:06,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 476 transitions, 7029 flow [2021-06-11 14:31:07,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 476 transitions, 6233 flow, removed 242 selfloop flow, removed 14 redundant places. [2021-06-11 14:31:07,619 INFO L241 Difference]: Finished difference. Result has 172 places, 281 transitions, 4073 flow [2021-06-11 14:31:07,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=2646, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4073, PETRI_PLACES=172, PETRI_TRANSITIONS=281} [2021-06-11 14:31:07,620 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 107 predicate places. [2021-06-11 14:31:07,620 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:07,620 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 281 transitions, 4073 flow [2021-06-11 14:31:07,620 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 281 transitions, 4073 flow [2021-06-11 14:31:07,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 281 transitions, 4073 flow [2021-06-11 14:31:08,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][22], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:08,054 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,054 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,054 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,054 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,055 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][22], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:08,055 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,055 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,055 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,055 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,072 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][22], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:08,072 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,072 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,072 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,072 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:08,516 INFO L129 PetriNetUnfolder]: 3945/8771 cut-off events. [2021-06-11 14:31:08,516 INFO L130 PetriNetUnfolder]: For 123152/128184 co-relation queries the response was YES. [2021-06-11 14:31:08,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53655 conditions, 8771 events. 3945/8771 cut-off events. For 123152/128184 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 87183 event pairs, 631 based on Foata normal form. 310/6740 useless extension candidates. Maximal degree in co-relation 52347. Up to 2458 conditions per place. [2021-06-11 14:31:08,641 INFO L151 LiptonReduction]: Number of co-enabled transitions 5848 [2021-06-11 14:31:08,757 INFO L142 QuantifierPusher]: treesize reduction 30, result has 97.8 percent of original size [2021-06-11 14:31:08,786 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:31:09,131 INFO L163 LiptonReduction]: Checked pairs total: 318 [2021-06-11 14:31:09,131 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 14:31:09,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1512 [2021-06-11 14:31:09,132 INFO L480 AbstractCegarLoop]: Abstraction has has 172 places, 281 transitions, 4077 flow [2021-06-11 14:31:09,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:09,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:09,133 INFO L263 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] [2021-06-11 14:31:09,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 14:31:09,133 INFO L428 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 507578186, now seen corresponding path program 1 times [2021-06-11 14:31:09,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:09,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810735887] [2021-06-11 14:31:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:09,152 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:09,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:09,157 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:09,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:09,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:09,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:09,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:09,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:09,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:09,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:09,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:09,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810735887] [2021-06-11 14:31:09,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:09,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:09,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433303956] [2021-06-11 14:31:09,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:09,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:09,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 307 [2021-06-11 14:31:09,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 281 transitions, 4077 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:09,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:09,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 307 [2021-06-11 14:31:09,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:12,181 INFO L129 PetriNetUnfolder]: 11537/19953 cut-off events. [2021-06-11 14:31:12,182 INFO L130 PetriNetUnfolder]: For 189009/190013 co-relation queries the response was YES. [2021-06-11 14:31:12,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130795 conditions, 19953 events. 11537/19953 cut-off events. For 189009/190013 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 168987 event pairs, 1359 based on Foata normal form. 847/14142 useless extension candidates. Maximal degree in co-relation 128922. Up to 6403 conditions per place. [2021-06-11 14:31:12,336 INFO L132 encePairwiseOnDemand]: 284/307 looper letters, 283 selfloop transitions, 156 changer transitions 37/501 dead transitions. [2021-06-11 14:31:12,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 501 transitions, 7651 flow [2021-06-11 14:31:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 14:31:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 14:31:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2556 transitions. [2021-06-11 14:31:12,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6404409922325232 [2021-06-11 14:31:12,338 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2556 transitions. [2021-06-11 14:31:12,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2556 transitions. [2021-06-11 14:31:12,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:12,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2556 transitions. [2021-06-11 14:31:12,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 196.6153846153846) internal successors, (2556), 13 states have internal predecessors, (2556), 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) [2021-06-11 14:31:12,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 307.0) internal successors, (4298), 14 states have internal predecessors, (4298), 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) [2021-06-11 14:31:12,344 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 307.0) internal successors, (4298), 14 states have internal predecessors, (4298), 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) [2021-06-11 14:31:12,344 INFO L185 Difference]: Start difference. First operand has 172 places, 281 transitions, 4077 flow. Second operand 13 states and 2556 transitions. [2021-06-11 14:31:12,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 501 transitions, 7651 flow [2021-06-11 14:31:14,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 501 transitions, 7341 flow, removed 112 selfloop flow, removed 3 redundant places. [2021-06-11 14:31:14,340 INFO L241 Difference]: Finished difference. Result has 186 places, 304 transitions, 4624 flow [2021-06-11 14:31:14,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=3871, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4624, PETRI_PLACES=186, PETRI_TRANSITIONS=304} [2021-06-11 14:31:14,341 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 121 predicate places. [2021-06-11 14:31:14,341 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:14,341 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 304 transitions, 4624 flow [2021-06-11 14:31:14,341 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 304 transitions, 4624 flow [2021-06-11 14:31:14,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 186 places, 304 transitions, 4624 flow [2021-06-11 14:31:14,758 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][59], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:14,759 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,759 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,759 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,759 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,920 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][59], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:14,921 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][59], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:14,921 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:15,263 INFO L129 PetriNetUnfolder]: 4085/9234 cut-off events. [2021-06-11 14:31:15,263 INFO L130 PetriNetUnfolder]: For 137319/143001 co-relation queries the response was YES. [2021-06-11 14:31:15,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57799 conditions, 9234 events. 4085/9234 cut-off events. For 137319/143001 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 93887 event pairs, 710 based on Foata normal form. 284/7180 useless extension candidates. Maximal degree in co-relation 56281. Up to 2489 conditions per place. [2021-06-11 14:31:15,426 INFO L151 LiptonReduction]: Number of co-enabled transitions 6004 [2021-06-11 14:31:15,708 INFO L163 LiptonReduction]: Checked pairs total: 39 [2021-06-11 14:31:15,708 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:31:15,708 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1367 [2021-06-11 14:31:15,709 INFO L480 AbstractCegarLoop]: Abstraction has has 186 places, 304 transitions, 4624 flow [2021-06-11 14:31:15,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:15,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:15,709 INFO L263 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] [2021-06-11 14:31:15,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 14:31:15,709 INFO L428 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -490008836, now seen corresponding path program 2 times [2021-06-11 14:31:15,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:15,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564814856] [2021-06-11 14:31:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:15,757 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:15,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:15,762 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:15,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:15,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:15,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:15,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:15,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:15,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:15,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:15,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:15,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564814856] [2021-06-11 14:31:15,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:15,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:15,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956963330] [2021-06-11 14:31:15,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:15,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:15,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:15,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:15,804 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 307 [2021-06-11 14:31:15,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 304 transitions, 4624 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:15,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:15,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 307 [2021-06-11 14:31:15,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:16,047 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2021-06-11 14:31:19,040 INFO L129 PetriNetUnfolder]: 12101/21422 cut-off events. [2021-06-11 14:31:19,041 INFO L130 PetriNetUnfolder]: For 256851/257873 co-relation queries the response was YES. [2021-06-11 14:31:19,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145503 conditions, 21422 events. 12101/21422 cut-off events. For 256851/257873 co-relation queries the response was YES. Maximal size of possible extension queue 1402. Compared 188763 event pairs, 1466 based on Foata normal form. 947/15458 useless extension candidates. Maximal degree in co-relation 143612. Up to 5297 conditions per place. [2021-06-11 14:31:19,425 INFO L132 encePairwiseOnDemand]: 283/307 looper letters, 311 selfloop transitions, 238 changer transitions 50/624 dead transitions. [2021-06-11 14:31:19,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 624 transitions, 10196 flow [2021-06-11 14:31:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-11 14:31:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-11 14:31:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3124 transitions. [2021-06-11 14:31:19,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6359934853420195 [2021-06-11 14:31:19,427 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3124 transitions. [2021-06-11 14:31:19,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3124 transitions. [2021-06-11 14:31:19,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:19,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3124 transitions. [2021-06-11 14:31:19,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 195.25) internal successors, (3124), 16 states have internal predecessors, (3124), 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) [2021-06-11 14:31:19,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 307.0) internal successors, (5219), 17 states have internal predecessors, (5219), 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) [2021-06-11 14:31:19,433 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 307.0) internal successors, (5219), 17 states have internal predecessors, (5219), 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) [2021-06-11 14:31:19,434 INFO L185 Difference]: Start difference. First operand has 186 places, 304 transitions, 4624 flow. Second operand 16 states and 3124 transitions. [2021-06-11 14:31:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 624 transitions, 10196 flow [2021-06-11 14:31:22,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 624 transitions, 10095 flow, removed 14 selfloop flow, removed 2 redundant places. [2021-06-11 14:31:22,149 INFO L241 Difference]: Finished difference. Result has 207 places, 408 transitions, 7229 flow [2021-06-11 14:31:22,150 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=4545, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7229, PETRI_PLACES=207, PETRI_TRANSITIONS=408} [2021-06-11 14:31:22,150 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 142 predicate places. [2021-06-11 14:31:22,150 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:22,150 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 408 transitions, 7229 flow [2021-06-11 14:31:22,150 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 408 transitions, 7229 flow [2021-06-11 14:31:22,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 207 places, 408 transitions, 7229 flow [2021-06-11 14:31:22,672 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][246], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:22,672 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,672 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,673 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][246], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:22,676 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,676 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,676 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,676 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][246], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:22,676 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,677 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,677 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:22,677 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:23,301 INFO L129 PetriNetUnfolder]: 4606/10562 cut-off events. [2021-06-11 14:31:23,301 INFO L130 PetriNetUnfolder]: For 195964/202824 co-relation queries the response was YES. [2021-06-11 14:31:23,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70425 conditions, 10562 events. 4606/10562 cut-off events. For 195964/202824 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 110805 event pairs, 715 based on Foata normal form. 459/8499 useless extension candidates. Maximal degree in co-relation 69747. Up to 2860 conditions per place. [2021-06-11 14:31:23,499 INFO L151 LiptonReduction]: Number of co-enabled transitions 7162 [2021-06-11 14:31:23,686 INFO L142 QuantifierPusher]: treesize reduction 43, result has 97.8 percent of original size [2021-06-11 14:31:23,719 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:31:25,201 INFO L142 QuantifierPusher]: treesize reduction 37, result has 97.8 percent of original size [2021-06-11 14:31:25,230 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:31:26,779 INFO L163 LiptonReduction]: Checked pairs total: 3519 [2021-06-11 14:31:26,780 INFO L165 LiptonReduction]: Total number of compositions: 21 [2021-06-11 14:31:26,780 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4630 [2021-06-11 14:31:26,780 INFO L480 AbstractCegarLoop]: Abstraction has has 207 places, 408 transitions, 7271 flow [2021-06-11 14:31:26,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:26,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:26,781 INFO L263 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] [2021-06-11 14:31:26,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 14:31:26,781 INFO L428 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1569050620, now seen corresponding path program 3 times [2021-06-11 14:31:26,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:26,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753244313] [2021-06-11 14:31:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:26,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:26,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:26,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:26,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:26,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753244313] [2021-06-11 14:31:26,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:26,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 14:31:26,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008742413] [2021-06-11 14:31:26,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 14:31:26,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 14:31:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 14:31:26,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 328 [2021-06-11 14:31:26,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 408 transitions, 7271 flow. Second operand has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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) [2021-06-11 14:31:26,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:26,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 328 [2021-06-11 14:31:26,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:28,352 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,352 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,352 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,352 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,352 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,364 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,364 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,364 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,364 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,364 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,367 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,367 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,367 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,367 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,367 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:28,915 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 432#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 116#L787-1true, Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,915 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, 327#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 116#L787-1true, Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,922 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,922 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,922 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,922 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,925 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][196], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 116#L787-1true, Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:28,925 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,925 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,925 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:28,925 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-06-11 14:31:31,012 INFO L129 PetriNetUnfolder]: 13215/26325 cut-off events. [2021-06-11 14:31:31,012 INFO L130 PetriNetUnfolder]: For 566587/584026 co-relation queries the response was YES. [2021-06-11 14:31:31,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187809 conditions, 26325 events. 13215/26325 cut-off events. For 566587/584026 co-relation queries the response was YES. Maximal size of possible extension queue 2254. Compared 278549 event pairs, 1717 based on Foata normal form. 772/20848 useless extension candidates. Maximal degree in co-relation 185596. Up to 7007 conditions per place. [2021-06-11 14:31:31,365 INFO L132 encePairwiseOnDemand]: 323/328 looper letters, 40 selfloop transitions, 15 changer transitions 49/440 dead transitions. [2021-06-11 14:31:31,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 440 transitions, 7786 flow [2021-06-11 14:31:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 14:31:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 14:31:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1220 transitions. [2021-06-11 14:31:31,369 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7439024390243902 [2021-06-11 14:31:31,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1220 transitions. [2021-06-11 14:31:31,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1220 transitions. [2021-06-11 14:31:31,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:31,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1220 transitions. [2021-06-11 14:31:31,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 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) [2021-06-11 14:31:31,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 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) [2021-06-11 14:31:31,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 328.0) internal successors, (1968), 6 states have internal predecessors, (1968), 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) [2021-06-11 14:31:31,371 INFO L185 Difference]: Start difference. First operand has 207 places, 408 transitions, 7271 flow. Second operand 5 states and 1220 transitions. [2021-06-11 14:31:31,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 440 transitions, 7786 flow [2021-06-11 14:31:37,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 440 transitions, 7652 flow, removed 67 selfloop flow, removed 0 redundant places. [2021-06-11 14:31:37,987 INFO L241 Difference]: Finished difference. Result has 213 places, 374 transitions, 6292 flow [2021-06-11 14:31:37,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=7137, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6292, PETRI_PLACES=213, PETRI_TRANSITIONS=374} [2021-06-11 14:31:37,987 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 148 predicate places. [2021-06-11 14:31:37,987 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:37,988 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 374 transitions, 6292 flow [2021-06-11 14:31:37,988 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 374 transitions, 6292 flow [2021-06-11 14:31:37,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 374 transitions, 6292 flow [2021-06-11 14:31:38,557 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][74], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 432#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 495#(= ~readerprogress2~0 0), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:38,557 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,557 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,557 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,557 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][74], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 307#(= ~readerprogress1~0 2), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 432#true, 327#true, Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 495#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:38,560 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([886] L746-2-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| (ite (and (<= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 0) (< 0 v_~ctr1~0_146)) 1 0)) (= v_~ctr1~0_145 (+ v_~ctr1~0_146 1)) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (= v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, ~ctr1~0=v_~ctr1~0_146} OutVars{qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5_5|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx_5, qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_17, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx_5|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_7, ~ctr1~0=v_~ctr1~0_145, qrcu_reader2Thread1of1ForFork1_#t~nondet13=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet13_13|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_7|} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, ~ctr1~0, qrcu_reader2Thread1of1ForFork1_#t~nondet13, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond][74], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 247#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 395#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 21#L786-2true, 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 45#L744-3true, Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 173#true, 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 186#(= ~readerprogress1~0 0), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), 189#true, 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 327#true, Black: 432#true, Black: 450#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 100#qrcu_reader1EXITtrue, Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 459#true, Black: 475#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), 366#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 234#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 498#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 495#(= ~readerprogress2~0 0), Black: 358#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0))]) [2021-06-11 14:31:38,560 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:38,560 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-06-11 14:31:39,350 INFO L129 PetriNetUnfolder]: 5078/11748 cut-off events. [2021-06-11 14:31:39,350 INFO L130 PetriNetUnfolder]: For 214329/220775 co-relation queries the response was YES. [2021-06-11 14:31:39,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78009 conditions, 11748 events. 5078/11748 cut-off events. For 214329/220775 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 126613 event pairs, 794 based on Foata normal form. 347/9327 useless extension candidates. Maximal degree in co-relation 76824. Up to 3281 conditions per place. [2021-06-11 14:31:39,552 INFO L151 LiptonReduction]: Number of co-enabled transitions 6792 [2021-06-11 14:31:39,715 INFO L163 LiptonReduction]: Checked pairs total: 39 [2021-06-11 14:31:39,715 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:31:39,715 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1728 [2021-06-11 14:31:39,716 INFO L480 AbstractCegarLoop]: Abstraction has has 213 places, 374 transitions, 6292 flow [2021-06-11 14:31:39,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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) [2021-06-11 14:31:39,716 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:39,716 INFO L263 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] [2021-06-11 14:31:39,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 14:31:39,716 INFO L428 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1121079815, now seen corresponding path program 1 times [2021-06-11 14:31:39,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:39,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685211016] [2021-06-11 14:31:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:39,733 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:39,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:39,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:39,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:39,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:39,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:39,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:39,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:39,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:39,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:39,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685211016] [2021-06-11 14:31:39,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:39,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:39,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302830344] [2021-06-11 14:31:39,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:39,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:39,782 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 328 [2021-06-11 14:31:39,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 374 transitions, 6292 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:39,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:39,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 328 [2021-06-11 14:31:39,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:43,702 INFO L129 PetriNetUnfolder]: 13187/23631 cut-off events. [2021-06-11 14:31:43,702 INFO L130 PetriNetUnfolder]: For 314880/317644 co-relation queries the response was YES. [2021-06-11 14:31:44,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167874 conditions, 23631 events. 13187/23631 cut-off events. For 314880/317644 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 214140 event pairs, 2884 based on Foata normal form. 803/17033 useless extension candidates. Maximal degree in co-relation 166391. Up to 7139 conditions per place. [2021-06-11 14:31:44,082 INFO L132 encePairwiseOnDemand]: 300/328 looper letters, 197 selfloop transitions, 117 changer transitions 215/555 dead transitions. [2021-06-11 14:31:44,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 555 transitions, 9747 flow [2021-06-11 14:31:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-11 14:31:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-11 14:31:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2334 transitions. [2021-06-11 14:31:44,084 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5929878048780488 [2021-06-11 14:31:44,084 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2334 transitions. [2021-06-11 14:31:44,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2334 transitions. [2021-06-11 14:31:44,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:44,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2334 transitions. [2021-06-11 14:31:44,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 194.5) internal successors, (2334), 12 states have internal predecessors, (2334), 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) [2021-06-11 14:31:44,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 328.0) internal successors, (4264), 13 states have internal predecessors, (4264), 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) [2021-06-11 14:31:44,089 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 328.0) internal successors, (4264), 13 states have internal predecessors, (4264), 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) [2021-06-11 14:31:44,089 INFO L185 Difference]: Start difference. First operand has 213 places, 374 transitions, 6292 flow. Second operand 12 states and 2334 transitions. [2021-06-11 14:31:44,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 555 transitions, 9747 flow [2021-06-11 14:31:48,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 555 transitions, 9664 flow, removed 22 selfloop flow, removed 1 redundant places. [2021-06-11 14:31:48,319 INFO L241 Difference]: Finished difference. Result has 230 places, 269 transitions, 4905 flow [2021-06-11 14:31:48,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4905, PETRI_PLACES=230, PETRI_TRANSITIONS=269} [2021-06-11 14:31:48,319 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 165 predicate places. [2021-06-11 14:31:48,320 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:48,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 269 transitions, 4905 flow [2021-06-11 14:31:48,320 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 269 transitions, 4905 flow [2021-06-11 14:31:48,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 218 places, 269 transitions, 4905 flow [2021-06-11 14:31:48,959 INFO L129 PetriNetUnfolder]: 2533/6027 cut-off events. [2021-06-11 14:31:48,960 INFO L130 PetriNetUnfolder]: For 120466/121478 co-relation queries the response was YES. [2021-06-11 14:31:49,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45381 conditions, 6027 events. 2533/6027 cut-off events. For 120466/121478 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 59882 event pairs, 367 based on Foata normal form. 152/4885 useless extension candidates. Maximal degree in co-relation 44800. Up to 1952 conditions per place. [2021-06-11 14:31:49,083 INFO L151 LiptonReduction]: Number of co-enabled transitions 4302 [2021-06-11 14:31:49,222 INFO L142 QuantifierPusher]: treesize reduction 22, result has 97.8 percent of original size [2021-06-11 14:31:49,254 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:31:49,700 INFO L163 LiptonReduction]: Checked pairs total: 443 [2021-06-11 14:31:49,700 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 14:31:49,701 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1381 [2021-06-11 14:31:49,701 INFO L480 AbstractCegarLoop]: Abstraction has has 218 places, 269 transitions, 4911 flow [2021-06-11 14:31:49,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:49,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:49,701 INFO L263 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] [2021-06-11 14:31:49,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 14:31:49,702 INFO L428 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash 640099928, now seen corresponding path program 1 times [2021-06-11 14:31:49,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:49,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672381054] [2021-06-11 14:31:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:49,720 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:49,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:49,725 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:49,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:49,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:49,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:49,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:49,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:49,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:49,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:49,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:49,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672381054] [2021-06-11 14:31:49,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:49,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:49,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612672019] [2021-06-11 14:31:49,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:49,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:49,767 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:31:49,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 269 transitions, 4911 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:49,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:49,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:31:49,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:51,463 INFO L129 PetriNetUnfolder]: 4516/9289 cut-off events. [2021-06-11 14:31:51,463 INFO L130 PetriNetUnfolder]: For 185503/186606 co-relation queries the response was YES. [2021-06-11 14:31:51,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74590 conditions, 9289 events. 4516/9289 cut-off events. For 185503/186606 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 84205 event pairs, 617 based on Foata normal form. 186/7774 useless extension candidates. Maximal degree in co-relation 73760. Up to 3307 conditions per place. [2021-06-11 14:31:51,544 INFO L132 encePairwiseOnDemand]: 311/331 looper letters, 228 selfloop transitions, 101 changer transitions 20/375 dead transitions. [2021-06-11 14:31:51,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 375 transitions, 7168 flow [2021-06-11 14:31:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-11 14:31:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-11 14:31:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2279 transitions. [2021-06-11 14:31:51,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.573766364551863 [2021-06-11 14:31:51,546 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2279 transitions. [2021-06-11 14:31:51,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2279 transitions. [2021-06-11 14:31:51,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:51,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2279 transitions. [2021-06-11 14:31:51,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 189.91666666666666) internal successors, (2279), 12 states have internal predecessors, (2279), 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) [2021-06-11 14:31:51,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 331.0) internal successors, (4303), 13 states have internal predecessors, (4303), 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) [2021-06-11 14:31:51,551 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 331.0) internal successors, (4303), 13 states have internal predecessors, (4303), 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) [2021-06-11 14:31:51,551 INFO L185 Difference]: Start difference. First operand has 218 places, 269 transitions, 4911 flow. Second operand 12 states and 2279 transitions. [2021-06-11 14:31:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 375 transitions, 7168 flow [2021-06-11 14:31:52,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 375 transitions, 6737 flow, removed 100 selfloop flow, removed 13 redundant places. [2021-06-11 14:31:52,611 INFO L241 Difference]: Finished difference. Result has 219 places, 280 transitions, 5046 flow [2021-06-11 14:31:52,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=4502, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5046, PETRI_PLACES=219, PETRI_TRANSITIONS=280} [2021-06-11 14:31:52,617 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 154 predicate places. [2021-06-11 14:31:52,617 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:52,617 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 280 transitions, 5046 flow [2021-06-11 14:31:52,617 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 280 transitions, 5046 flow [2021-06-11 14:31:52,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 219 places, 280 transitions, 5046 flow [2021-06-11 14:31:53,346 INFO L129 PetriNetUnfolder]: 2681/6481 cut-off events. [2021-06-11 14:31:53,347 INFO L130 PetriNetUnfolder]: For 139212/140166 co-relation queries the response was YES. [2021-06-11 14:31:53,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48436 conditions, 6481 events. 2681/6481 cut-off events. For 139212/140166 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 65521 event pairs, 377 based on Foata normal form. 204/5328 useless extension candidates. Maximal degree in co-relation 47356. Up to 2148 conditions per place. [2021-06-11 14:31:53,464 INFO L151 LiptonReduction]: Number of co-enabled transitions 4344 [2021-06-11 14:31:53,587 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:31:53,587 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:31:53,587 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 970 [2021-06-11 14:31:53,587 INFO L480 AbstractCegarLoop]: Abstraction has has 219 places, 280 transitions, 5046 flow [2021-06-11 14:31:53,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:53,588 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:53,588 INFO L263 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] [2021-06-11 14:31:53,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 14:31:53,588 INFO L428 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:53,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1323545907, now seen corresponding path program 1 times [2021-06-11 14:31:53,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:53,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564569579] [2021-06-11 14:31:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:53,610 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:53,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:53,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:53,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:53,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:53,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:53,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:53,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:31:53,652 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:31:53,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:53,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:53,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:53,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564569579] [2021-06-11 14:31:53,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:53,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 14:31:53,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758567122] [2021-06-11 14:31:53,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 14:31:53,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 14:31:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 14:31:53,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:31:53,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 280 transitions, 5046 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:31:53,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:53,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:31:53,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:55,196 INFO L129 PetriNetUnfolder]: 4938/9626 cut-off events. [2021-06-11 14:31:55,196 INFO L130 PetriNetUnfolder]: For 184469/184847 co-relation queries the response was YES. [2021-06-11 14:31:55,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79548 conditions, 9626 events. 4938/9626 cut-off events. For 184469/184847 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 84803 event pairs, 720 based on Foata normal form. 143/7521 useless extension candidates. Maximal degree in co-relation 78193. Up to 5460 conditions per place. [2021-06-11 14:31:55,295 INFO L132 encePairwiseOnDemand]: 312/331 looper letters, 248 selfloop transitions, 99 changer transitions 14/387 dead transitions. [2021-06-11 14:31:55,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 387 transitions, 7380 flow [2021-06-11 14:31:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:31:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:31:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1743 transitions. [2021-06-11 14:31:55,297 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5850956696878147 [2021-06-11 14:31:55,297 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1743 transitions. [2021-06-11 14:31:55,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1743 transitions. [2021-06-11 14:31:55,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:55,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1743 transitions. [2021-06-11 14:31:55,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.66666666666666) internal successors, (1743), 9 states have internal predecessors, (1743), 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) [2021-06-11 14:31:55,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 331.0) internal successors, (3310), 10 states have internal predecessors, (3310), 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) [2021-06-11 14:31:55,301 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 331.0) internal successors, (3310), 10 states have internal predecessors, (3310), 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) [2021-06-11 14:31:55,301 INFO L185 Difference]: Start difference. First operand has 219 places, 280 transitions, 5046 flow. Second operand 9 states and 1743 transitions. [2021-06-11 14:31:55,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 387 transitions, 7380 flow [2021-06-11 14:31:56,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 387 transitions, 7340 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-06-11 14:31:56,432 INFO L241 Difference]: Finished difference. Result has 228 places, 300 transitions, 5739 flow [2021-06-11 14:31:56,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=5006, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5739, PETRI_PLACES=228, PETRI_TRANSITIONS=300} [2021-06-11 14:31:56,432 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 163 predicate places. [2021-06-11 14:31:56,432 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:31:56,432 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 300 transitions, 5739 flow [2021-06-11 14:31:56,432 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 300 transitions, 5739 flow [2021-06-11 14:31:56,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 228 places, 300 transitions, 5739 flow [2021-06-11 14:31:57,144 INFO L129 PetriNetUnfolder]: 2723/6682 cut-off events. [2021-06-11 14:31:57,144 INFO L130 PetriNetUnfolder]: For 165836/167210 co-relation queries the response was YES. [2021-06-11 14:31:57,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51951 conditions, 6682 events. 2723/6682 cut-off events. For 165836/167210 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 68368 event pairs, 356 based on Foata normal form. 317/5621 useless extension candidates. Maximal degree in co-relation 50690. Up to 2137 conditions per place. [2021-06-11 14:31:57,277 INFO L151 LiptonReduction]: Number of co-enabled transitions 4510 [2021-06-11 14:31:57,365 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:31:57,365 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:31:57,365 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 933 [2021-06-11 14:31:57,365 INFO L480 AbstractCegarLoop]: Abstraction has has 228 places, 300 transitions, 5739 flow [2021-06-11 14:31:57,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:31:57,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:31:57,366 INFO L263 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] [2021-06-11 14:31:57,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 14:31:57,366 INFO L428 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:31:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:31:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash -358595913, now seen corresponding path program 1 times [2021-06-11 14:31:57,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:31:57,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492454464] [2021-06-11 14:31:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:31:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:31:57,382 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:31:57,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:57,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:57,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:57,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:31:57,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:57,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:31:57,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:31:57,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:31:57,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:31:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:31:57,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492454464] [2021-06-11 14:31:57,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:31:57,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:31:57,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692027396] [2021-06-11 14:31:57,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:31:57,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:31:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:31:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:31:57,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:31:57,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 300 transitions, 5739 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:31:57,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:31:57,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:31:57,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:31:59,219 INFO L129 PetriNetUnfolder]: 4816/9466 cut-off events. [2021-06-11 14:31:59,219 INFO L130 PetriNetUnfolder]: For 200068/200461 co-relation queries the response was YES. [2021-06-11 14:31:59,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80470 conditions, 9466 events. 4816/9466 cut-off events. For 200068/200461 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 83773 event pairs, 568 based on Foata normal form. 255/7473 useless extension candidates. Maximal degree in co-relation 79116. Up to 3487 conditions per place. [2021-06-11 14:31:59,307 INFO L132 encePairwiseOnDemand]: 310/331 looper letters, 232 selfloop transitions, 138 changer transitions 21/417 dead transitions. [2021-06-11 14:31:59,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 417 transitions, 8263 flow [2021-06-11 14:31:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-11 14:31:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-11 14:31:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2658 transitions. [2021-06-11 14:31:59,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5735865343116099 [2021-06-11 14:31:59,310 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2658 transitions. [2021-06-11 14:31:59,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2658 transitions. [2021-06-11 14:31:59,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:31:59,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2658 transitions. [2021-06-11 14:31:59,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 189.85714285714286) internal successors, (2658), 14 states have internal predecessors, (2658), 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) [2021-06-11 14:31:59,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 331.0) internal successors, (4965), 15 states have internal predecessors, (4965), 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) [2021-06-11 14:31:59,321 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 331.0) internal successors, (4965), 15 states have internal predecessors, (4965), 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) [2021-06-11 14:31:59,321 INFO L185 Difference]: Start difference. First operand has 228 places, 300 transitions, 5739 flow. Second operand 14 states and 2658 transitions. [2021-06-11 14:31:59,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 417 transitions, 8263 flow [2021-06-11 14:32:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 417 transitions, 8096 flow, removed 53 selfloop flow, removed 2 redundant places. [2021-06-11 14:32:00,426 INFO L241 Difference]: Finished difference. Result has 245 places, 320 transitions, 6283 flow [2021-06-11 14:32:00,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6283, PETRI_PLACES=245, PETRI_TRANSITIONS=320} [2021-06-11 14:32:00,426 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 180 predicate places. [2021-06-11 14:32:00,426 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:00,426 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 320 transitions, 6283 flow [2021-06-11 14:32:00,426 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 320 transitions, 6283 flow [2021-06-11 14:32:00,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 245 places, 320 transitions, 6283 flow [2021-06-11 14:32:01,116 INFO L129 PetriNetUnfolder]: 2608/6439 cut-off events. [2021-06-11 14:32:01,116 INFO L130 PetriNetUnfolder]: For 179580/180612 co-relation queries the response was YES. [2021-06-11 14:32:01,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50543 conditions, 6439 events. 2608/6439 cut-off events. For 179580/180612 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 66170 event pairs, 349 based on Foata normal form. 325/5410 useless extension candidates. Maximal degree in co-relation 50157. Up to 2068 conditions per place. [2021-06-11 14:32:01,248 INFO L151 LiptonReduction]: Number of co-enabled transitions 4592 [2021-06-11 14:32:01,325 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:32:01,325 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:01,325 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 899 [2021-06-11 14:32:01,326 INFO L480 AbstractCegarLoop]: Abstraction has has 245 places, 320 transitions, 6283 flow [2021-06-11 14:32:01,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:01,326 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:01,326 INFO L263 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] [2021-06-11 14:32:01,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 14:32:01,326 INFO L428 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash -695911275, now seen corresponding path program 2 times [2021-06-11 14:32:01,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:01,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596959147] [2021-06-11 14:32:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:01,343 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:01,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:01,347 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:01,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:01,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:01,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:01,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:01,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:01,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:32:01,388 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:32:01,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:01,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:01,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:01,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596959147] [2021-06-11 14:32:01,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:01,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 14:32:01,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121506016] [2021-06-11 14:32:01,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 14:32:01,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:01,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 14:32:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-11 14:32:01,391 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:32:01,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 320 transitions, 6283 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:32:01,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:01,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:32:01,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:03,047 INFO L129 PetriNetUnfolder]: 4916/9583 cut-off events. [2021-06-11 14:32:03,048 INFO L130 PetriNetUnfolder]: For 235087/235511 co-relation queries the response was YES. [2021-06-11 14:32:03,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83181 conditions, 9583 events. 4916/9583 cut-off events. For 235087/235511 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 84406 event pairs, 668 based on Foata normal form. 199/7446 useless extension candidates. Maximal degree in co-relation 82801. Up to 4543 conditions per place. [2021-06-11 14:32:03,156 INFO L132 encePairwiseOnDemand]: 312/331 looper letters, 295 selfloop transitions, 128 changer transitions 23/472 dead transitions. [2021-06-11 14:32:03,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 472 transitions, 9862 flow [2021-06-11 14:32:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 14:32:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 14:32:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2130 transitions. [2021-06-11 14:32:03,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5850041197473221 [2021-06-11 14:32:03,158 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2130 transitions. [2021-06-11 14:32:03,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2130 transitions. [2021-06-11 14:32:03,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:03,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2130 transitions. [2021-06-11 14:32:03,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 193.63636363636363) internal successors, (2130), 11 states have internal predecessors, (2130), 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) [2021-06-11 14:32:03,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 331.0) internal successors, (3972), 12 states have internal predecessors, (3972), 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) [2021-06-11 14:32:03,162 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 331.0) internal successors, (3972), 12 states have internal predecessors, (3972), 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) [2021-06-11 14:32:03,162 INFO L185 Difference]: Start difference. First operand has 245 places, 320 transitions, 6283 flow. Second operand 11 states and 2130 transitions. [2021-06-11 14:32:03,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 472 transitions, 9862 flow [2021-06-11 14:32:04,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 472 transitions, 9719 flow, removed 25 selfloop flow, removed 3 redundant places. [2021-06-11 14:32:04,849 INFO L241 Difference]: Finished difference. Result has 256 places, 342 transitions, 7178 flow [2021-06-11 14:32:04,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=6189, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7178, PETRI_PLACES=256, PETRI_TRANSITIONS=342} [2021-06-11 14:32:04,849 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 191 predicate places. [2021-06-11 14:32:04,849 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:04,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 342 transitions, 7178 flow [2021-06-11 14:32:04,850 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 342 transitions, 7178 flow [2021-06-11 14:32:04,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 342 transitions, 7178 flow [2021-06-11 14:32:05,699 INFO L129 PetriNetUnfolder]: 2696/6591 cut-off events. [2021-06-11 14:32:05,699 INFO L130 PetriNetUnfolder]: For 201737/202625 co-relation queries the response was YES. [2021-06-11 14:32:05,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54822 conditions, 6591 events. 2696/6591 cut-off events. For 201737/202625 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 67605 event pairs, 361 based on Foata normal form. 161/5381 useless extension candidates. Maximal degree in co-relation 54475. Up to 2194 conditions per place. [2021-06-11 14:32:05,815 INFO L151 LiptonReduction]: Number of co-enabled transitions 4744 [2021-06-11 14:32:05,938 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:32:05,938 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:05,938 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1089 [2021-06-11 14:32:05,939 INFO L480 AbstractCegarLoop]: Abstraction has has 256 places, 342 transitions, 7178 flow [2021-06-11 14:32:05,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:32:05,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:05,939 INFO L263 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] [2021-06-11 14:32:05,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-11 14:32:05,939 INFO L428 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1769880873, now seen corresponding path program 2 times [2021-06-11 14:32:05,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:05,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136526458] [2021-06-11 14:32:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:05,959 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:05,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:05,963 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:05,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:05,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:05,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:05,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:05,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:05,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:05,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:05,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:05,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136526458] [2021-06-11 14:32:05,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:05,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:32:05,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877848883] [2021-06-11 14:32:05,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:32:05,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:32:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:32:06,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:32:06,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 342 transitions, 7178 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:06,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:06,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:32:06,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:07,924 INFO L129 PetriNetUnfolder]: 4885/9580 cut-off events. [2021-06-11 14:32:07,924 INFO L130 PetriNetUnfolder]: For 259117/259543 co-relation queries the response was YES. [2021-06-11 14:32:08,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85372 conditions, 9580 events. 4885/9580 cut-off events. For 259117/259543 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 84897 event pairs, 477 based on Foata normal form. 321/7568 useless extension candidates. Maximal degree in co-relation 84886. Up to 3644 conditions per place. [2021-06-11 14:32:08,032 INFO L132 encePairwiseOnDemand]: 308/331 looper letters, 266 selfloop transitions, 157 changer transitions 36/485 dead transitions. [2021-06-11 14:32:08,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 485 transitions, 10361 flow [2021-06-11 14:32:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-11 14:32:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-11 14:32:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2868 transitions. [2021-06-11 14:32:08,035 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5776435045317221 [2021-06-11 14:32:08,035 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2868 transitions. [2021-06-11 14:32:08,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2868 transitions. [2021-06-11 14:32:08,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:08,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2868 transitions. [2021-06-11 14:32:08,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 191.2) internal successors, (2868), 15 states have internal predecessors, (2868), 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) [2021-06-11 14:32:08,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 331.0) internal successors, (5296), 16 states have internal predecessors, (5296), 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) [2021-06-11 14:32:08,040 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 331.0) internal successors, (5296), 16 states have internal predecessors, (5296), 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) [2021-06-11 14:32:08,040 INFO L185 Difference]: Start difference. First operand has 256 places, 342 transitions, 7178 flow. Second operand 15 states and 2868 transitions. [2021-06-11 14:32:08,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 485 transitions, 10361 flow [2021-06-11 14:32:09,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 485 transitions, 10269 flow, removed 37 selfloop flow, removed 2 redundant places. [2021-06-11 14:32:09,850 INFO L241 Difference]: Finished difference. Result has 274 places, 354 transitions, 7856 flow [2021-06-11 14:32:09,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=7092, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7856, PETRI_PLACES=274, PETRI_TRANSITIONS=354} [2021-06-11 14:32:09,851 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 209 predicate places. [2021-06-11 14:32:09,851 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:09,851 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 354 transitions, 7856 flow [2021-06-11 14:32:09,851 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 354 transitions, 7856 flow [2021-06-11 14:32:09,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 274 places, 354 transitions, 7856 flow [2021-06-11 14:32:10,671 INFO L129 PetriNetUnfolder]: 2698/6545 cut-off events. [2021-06-11 14:32:10,671 INFO L130 PetriNetUnfolder]: For 240997/242450 co-relation queries the response was YES. [2021-06-11 14:32:10,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57166 conditions, 6545 events. 2698/6545 cut-off events. For 240997/242450 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 66457 event pairs, 368 based on Foata normal form. 348/5417 useless extension candidates. Maximal degree in co-relation 56685. Up to 2247 conditions per place. [2021-06-11 14:32:10,810 INFO L151 LiptonReduction]: Number of co-enabled transitions 4804 [2021-06-11 14:32:10,917 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:32:10,917 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:10,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1066 [2021-06-11 14:32:10,917 INFO L480 AbstractCegarLoop]: Abstraction has has 274 places, 354 transitions, 7856 flow [2021-06-11 14:32:10,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:10,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:10,918 INFO L263 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] [2021-06-11 14:32:10,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-11 14:32:10,918 INFO L428 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash -606664283, now seen corresponding path program 3 times [2021-06-11 14:32:10,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:10,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944610441] [2021-06-11 14:32:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:10,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:10,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:10,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:10,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:10,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:10,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:10,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944610441] [2021-06-11 14:32:10,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:10,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 14:32:10,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254126783] [2021-06-11 14:32:10,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 14:32:10,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 14:32:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 14:32:10,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 331 [2021-06-11 14:32:10,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 354 transitions, 7856 flow. Second operand has 5 states, 5 states have (on average 230.6) internal successors, (1153), 5 states have internal predecessors, (1153), 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) [2021-06-11 14:32:10,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:10,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 331 [2021-06-11 14:32:10,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:12,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([969] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_144 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_143 v_~ctr1~0_341) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_144} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_143} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][68], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 514#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 516#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 518#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 520#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 505#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 510#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 531#true, 21#L786-2true, Black: 538#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 539#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), Black: 563#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 567#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 569#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 557#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 320#(= ~readerprogress2~0 2), 577#true, Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 595#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 597#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 584#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 351#true, Black: 585#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 587#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 609#true, 100#qrcu_reader1EXITtrue, 110#qrcu_reader2EXITtrue, Black: 613#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 616#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 620#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 622#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 630#true, Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 376#true, Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 646#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 648#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 401#true, Black: 634#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 637#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 638#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 663#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 157#L767-4true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 432#true, Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 459#true, Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 495#(= ~readerprogress2~0 0), 502#true]) [2021-06-11 14:32:12,537 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 14:32:12,537 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:32:12,537 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:32:12,537 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 14:32:12,706 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][307], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 514#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 516#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 502#true, Black: 518#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 520#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 505#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 21#L786-2true, 539#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 531#true, Black: 538#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), Black: 563#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 567#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 569#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 557#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, 585#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 577#true, Black: 595#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 597#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 584#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 351#true, Black: 587#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 609#true, 100#qrcu_reader1EXITtrue, 110#qrcu_reader2EXITtrue, Black: 613#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 616#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 620#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 622#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 376#true, 638#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 140#L767-10true, Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 646#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 630#true, Black: 648#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 634#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 637#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 663#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 459#true, Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 495#(= ~readerprogress2~0 0), 510#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-06-11 14:32:12,707 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 14:32:12,707 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 14:32:12,707 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 14:32:12,707 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 14:32:12,753 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([969] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_144 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_143 v_~ctr1~0_341) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_144} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_143} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][68], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 514#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 516#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 518#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 520#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 505#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), Black: 510#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 531#true, Black: 538#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 539#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), Black: 563#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 567#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 569#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), 320#(= ~readerprogress2~0 2), Black: 557#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 577#true, Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 595#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 597#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 584#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 585#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 351#true, Black: 587#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 609#true, 100#qrcu_reader1EXITtrue, 110#qrcu_reader2EXITtrue, Black: 613#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 616#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 620#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 116#L787-1true, Black: 622#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 630#true, 376#true, Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 646#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 648#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 634#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 401#true, Black: 637#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 638#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 663#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 157#L767-4true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 432#true, Black: 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 181#(= ~readerprogress2~0 0), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 459#true, Black: 209#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 495#(= ~readerprogress2~0 0), 502#true]) [2021-06-11 14:32:12,753 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 14:32:12,753 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:32:12,753 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:32:12,753 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 14:32:12,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][307], [Black: 259#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 244#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress2~0 0)), Black: 251#(and (= ~ctr1~0 1) (= ~idx~0 0) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), Black: 514#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 516#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 502#true, Black: 518#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 520#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 505#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 273#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)), 539#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 531#true, Black: 538#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 292#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (not (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 1))), Black: 294#(and (= ~ctr1~0 1) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 278#(and (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 1)) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 270#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), 307#(= ~readerprogress1~0 2), Black: 311#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2)), Black: 563#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 313#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|)) (= ~readerprogress1~0 2) (= 2 |qrcu_updaterThread1of1ForFork2_#t~mem22|)), Black: 567#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 569#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 557#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 320#(= ~readerprogress2~0 2), Black: 323#(and (= ~readerprogress2~0 2) (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|))), 327#true, 585#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 329#(= ~ctr2~0 0), Black: 330#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 331#(<= 1 ~ctr2~0), Black: 335#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 577#true, Black: 595#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= ~idx~0 0)), Black: 597#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), Black: 584#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 351#true, Black: 587#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= ~idx~0 0)), 609#true, 100#qrcu_reader1EXITtrue, 110#qrcu_reader2EXITtrue, Black: 613#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 616#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 355#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), Black: 620#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 116#L787-1true, Black: 622#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 364#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (= qrcu_reader1Thread1of1ForFork0_~myidx~0 0)), 376#true, 638#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 140#L767-10true, Black: 391#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 646#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 630#true, Black: 381#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 382#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 648#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 634#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 637#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 663#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 409#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 401#true, Black: 417#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 419#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 421#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 405#(and (= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 406#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 411#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 175#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 415#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 173#true, Black: 181#(= ~readerprogress2~0 0), 440#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 186#(= ~readerprogress1~0 0), 189#true, Black: 448#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 192#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 438#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 197#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 191#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 467#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 213#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 204#true, Black: 207#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 464#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 465#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 1 ~ctr1~0)), Black: 466#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 483#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 459#true, Black: 224#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0)), Black: 479#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 225#(and (= ~ctr1~0 1) (= ~idx~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 228#(= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0), Black: 230#(and (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~ctr1~0 1) (= ~idx~0 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 496#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 495#(= ~readerprogress2~0 0), 510#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-06-11 14:32:12,890 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 14:32:12,890 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-06-11 14:32:12,890 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 14:32:12,890 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 14:32:13,623 INFO L129 PetriNetUnfolder]: 7553/16283 cut-off events. [2021-06-11 14:32:13,623 INFO L130 PetriNetUnfolder]: For 560128/562816 co-relation queries the response was YES. [2021-06-11 14:32:14,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140078 conditions, 16283 events. 7553/16283 cut-off events. For 560128/562816 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 170996 event pairs, 1090 based on Foata normal form. 467/13563 useless extension candidates. Maximal degree in co-relation 138617. Up to 4929 conditions per place. [2021-06-11 14:32:14,225 INFO L132 encePairwiseOnDemand]: 323/331 looper letters, 46 selfloop transitions, 15 changer transitions 26/397 dead transitions. [2021-06-11 14:32:14,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 397 transitions, 8503 flow [2021-06-11 14:32:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 14:32:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 14:32:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1658 transitions. [2021-06-11 14:32:14,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7155804920155373 [2021-06-11 14:32:14,227 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1658 transitions. [2021-06-11 14:32:14,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1658 transitions. [2021-06-11 14:32:14,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:14,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1658 transitions. [2021-06-11 14:32:14,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 236.85714285714286) internal successors, (1658), 7 states have internal predecessors, (1658), 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) [2021-06-11 14:32:14,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 331.0) internal successors, (2648), 8 states have internal predecessors, (2648), 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) [2021-06-11 14:32:14,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 331.0) internal successors, (2648), 8 states have internal predecessors, (2648), 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) [2021-06-11 14:32:14,230 INFO L185 Difference]: Start difference. First operand has 274 places, 354 transitions, 7856 flow. Second operand 7 states and 1658 transitions. [2021-06-11 14:32:14,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 397 transitions, 8503 flow [2021-06-11 14:32:19,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 397 transitions, 8409 flow, removed 25 selfloop flow, removed 3 redundant places. [2021-06-11 14:32:19,248 INFO L241 Difference]: Finished difference. Result has 281 places, 351 transitions, 7730 flow [2021-06-11 14:32:19,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=7762, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7730, PETRI_PLACES=281, PETRI_TRANSITIONS=351} [2021-06-11 14:32:19,248 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 216 predicate places. [2021-06-11 14:32:19,248 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:19,248 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 351 transitions, 7730 flow [2021-06-11 14:32:19,248 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 351 transitions, 7730 flow [2021-06-11 14:32:19,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 351 transitions, 7730 flow [2021-06-11 14:32:20,061 INFO L129 PetriNetUnfolder]: 2454/6400 cut-off events. [2021-06-11 14:32:20,062 INFO L130 PetriNetUnfolder]: For 238037/239264 co-relation queries the response was YES. [2021-06-11 14:32:20,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54431 conditions, 6400 events. 2454/6400 cut-off events. For 238037/239264 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 67345 event pairs, 279 based on Foata normal form. 326/5606 useless extension candidates. Maximal degree in co-relation 54243. Up to 1883 conditions per place. [2021-06-11 14:32:20,210 INFO L151 LiptonReduction]: Number of co-enabled transitions 4498 [2021-06-11 14:32:20,266 INFO L163 LiptonReduction]: Checked pairs total: 34 [2021-06-11 14:32:20,266 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:20,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1018 [2021-06-11 14:32:20,267 INFO L480 AbstractCegarLoop]: Abstraction has has 276 places, 351 transitions, 7730 flow [2021-06-11 14:32:20,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 230.6) internal successors, (1153), 5 states have internal predecessors, (1153), 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) [2021-06-11 14:32:20,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:20,267 INFO L263 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] [2021-06-11 14:32:20,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-11 14:32:20,267 INFO L428 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 471665983, now seen corresponding path program 3 times [2021-06-11 14:32:20,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:20,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457784339] [2021-06-11 14:32:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:20,283 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:20,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:20,288 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:20,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:20,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:20,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:20,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:20,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:20,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:20,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:20,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:20,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457784339] [2021-06-11 14:32:20,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:20,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:32:20,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892476135] [2021-06-11 14:32:20,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:32:20,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:32:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:32:20,323 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 331 [2021-06-11 14:32:20,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 351 transitions, 7730 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:20,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:20,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 331 [2021-06-11 14:32:20,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:22,262 INFO L129 PetriNetUnfolder]: 4307/8918 cut-off events. [2021-06-11 14:32:22,262 INFO L130 PetriNetUnfolder]: For 291918/292280 co-relation queries the response was YES. [2021-06-11 14:32:22,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81787 conditions, 8918 events. 4307/8918 cut-off events. For 291918/292280 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 81793 event pairs, 445 based on Foata normal form. 323/7386 useless extension candidates. Maximal degree in co-relation 81616. Up to 2881 conditions per place. [2021-06-11 14:32:22,350 INFO L132 encePairwiseOnDemand]: 307/331 looper letters, 224 selfloop transitions, 117 changer transitions 126/488 dead transitions. [2021-06-11 14:32:22,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 488 transitions, 10890 flow [2021-06-11 14:32:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 14:32:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 14:32:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2509 transitions. [2021-06-11 14:32:22,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5830815709969789 [2021-06-11 14:32:22,352 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2509 transitions. [2021-06-11 14:32:22,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2509 transitions. [2021-06-11 14:32:22,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:22,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2509 transitions. [2021-06-11 14:32:22,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 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) [2021-06-11 14:32:22,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 331.0) internal successors, (4634), 14 states have internal predecessors, (4634), 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) [2021-06-11 14:32:22,356 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 331.0) internal successors, (4634), 14 states have internal predecessors, (4634), 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) [2021-06-11 14:32:22,356 INFO L185 Difference]: Start difference. First operand has 276 places, 351 transitions, 7730 flow. Second operand 13 states and 2509 transitions. [2021-06-11 14:32:22,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 488 transitions, 10890 flow [2021-06-11 14:32:24,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 488 transitions, 10728 flow, removed 81 selfloop flow, removed 5 redundant places. [2021-06-11 14:32:24,125 INFO L241 Difference]: Finished difference. Result has 287 places, 296 transitions, 6542 flow [2021-06-11 14:32:24,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=7622, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6542, PETRI_PLACES=287, PETRI_TRANSITIONS=296} [2021-06-11 14:32:24,126 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 222 predicate places. [2021-06-11 14:32:24,126 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:24,126 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 296 transitions, 6542 flow [2021-06-11 14:32:24,126 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 296 transitions, 6542 flow [2021-06-11 14:32:24,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 272 places, 296 transitions, 6542 flow [2021-06-11 14:32:24,420 INFO L129 PetriNetUnfolder]: 752/2466 cut-off events. [2021-06-11 14:32:24,420 INFO L130 PetriNetUnfolder]: For 91418/91580 co-relation queries the response was YES. [2021-06-11 14:32:24,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19034 conditions, 2466 events. 752/2466 cut-off events. For 91418/91580 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24065 event pairs, 60 based on Foata normal form. 57/2355 useless extension candidates. Maximal degree in co-relation 18692. Up to 425 conditions per place. [2021-06-11 14:32:24,501 INFO L151 LiptonReduction]: Number of co-enabled transitions 3198 [2021-06-11 14:32:24,620 INFO L142 QuantifierPusher]: treesize reduction 21, result has 97.8 percent of original size [2021-06-11 14:32:24,646 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:32:24,996 INFO L163 LiptonReduction]: Checked pairs total: 706 [2021-06-11 14:32:24,996 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-11 14:32:24,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 870 [2021-06-11 14:32:24,997 INFO L480 AbstractCegarLoop]: Abstraction has has 272 places, 296 transitions, 6550 flow [2021-06-11 14:32:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:24,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:24,997 INFO L263 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] [2021-06-11 14:32:24,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-11 14:32:24,997 INFO L428 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash 440781642, now seen corresponding path program 4 times [2021-06-11 14:32:24,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:24,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482517118] [2021-06-11 14:32:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:25,029 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:25,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:25,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:25,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:25,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:25,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:25,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:25,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 14:32:25,070 INFO L142 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-06-11 14:32:25,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:25,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:25,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:25,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482517118] [2021-06-11 14:32:25,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:25,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 14:32:25,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398868872] [2021-06-11 14:32:25,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 14:32:25,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 14:32:25,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 14:32:25,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 335 [2021-06-11 14:32:25,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 296 transitions, 6550 flow. Second operand has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:32:25,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:25,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 335 [2021-06-11 14:32:25,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:25,898 INFO L129 PetriNetUnfolder]: 1261/3155 cut-off events. [2021-06-11 14:32:25,898 INFO L130 PetriNetUnfolder]: For 113846/113945 co-relation queries the response was YES. [2021-06-11 14:32:25,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25942 conditions, 3155 events. 1261/3155 cut-off events. For 113846/113945 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 26952 event pairs, 124 based on Foata normal form. 65/2889 useless extension candidates. Maximal degree in co-relation 25589. Up to 1445 conditions per place. [2021-06-11 14:32:25,934 INFO L132 encePairwiseOnDemand]: 313/335 looper letters, 222 selfloop transitions, 108 changer transitions 21/372 dead transitions. [2021-06-11 14:32:25,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 372 transitions, 8616 flow [2021-06-11 14:32:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1722 transitions. [2021-06-11 14:32:25,935 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5711442786069652 [2021-06-11 14:32:25,936 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1722 transitions. [2021-06-11 14:32:25,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1722 transitions. [2021-06-11 14:32:25,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:25,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1722 transitions. [2021-06-11 14:32:25,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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) [2021-06-11 14:32:25,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:25,938 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:25,939 INFO L185 Difference]: Start difference. First operand has 272 places, 296 transitions, 6550 flow. Second operand 9 states and 1722 transitions. [2021-06-11 14:32:25,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 372 transitions, 8616 flow [2021-06-11 14:32:26,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 372 transitions, 8164 flow, removed 68 selfloop flow, removed 16 redundant places. [2021-06-11 14:32:26,339 INFO L241 Difference]: Finished difference. Result has 266 places, 303 transitions, 6650 flow [2021-06-11 14:32:26,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=6185, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6650, PETRI_PLACES=266, PETRI_TRANSITIONS=303} [2021-06-11 14:32:26,340 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 201 predicate places. [2021-06-11 14:32:26,340 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:26,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 303 transitions, 6650 flow [2021-06-11 14:32:26,341 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 303 transitions, 6650 flow [2021-06-11 14:32:26,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 266 places, 303 transitions, 6650 flow [2021-06-11 14:32:26,596 INFO L129 PetriNetUnfolder]: 696/2276 cut-off events. [2021-06-11 14:32:26,597 INFO L130 PetriNetUnfolder]: For 84896/85142 co-relation queries the response was YES. [2021-06-11 14:32:26,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17101 conditions, 2276 events. 696/2276 cut-off events. For 84896/85142 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 21783 event pairs, 56 based on Foata normal form. 35/2134 useless extension candidates. Maximal degree in co-relation 16751. Up to 381 conditions per place. [2021-06-11 14:32:26,641 INFO L151 LiptonReduction]: Number of co-enabled transitions 3064 [2021-06-11 14:32:26,665 INFO L163 LiptonReduction]: Checked pairs total: 29 [2021-06-11 14:32:26,666 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:26,666 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 326 [2021-06-11 14:32:26,667 INFO L480 AbstractCegarLoop]: Abstraction has has 266 places, 303 transitions, 6650 flow [2021-06-11 14:32:26,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 178.875) internal successors, (1431), 8 states have internal predecessors, (1431), 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) [2021-06-11 14:32:26,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:26,667 INFO L263 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] [2021-06-11 14:32:26,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-11 14:32:26,667 INFO L428 AbstractCegarLoop]: === Iteration 29 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash 639368434, now seen corresponding path program 2 times [2021-06-11 14:32:26,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:26,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062710553] [2021-06-11 14:32:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:26,737 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-06-11 14:32:26,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:26,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:26,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:26,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:26,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:26,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:26,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 14:32:26,764 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-06-11 14:32:26,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:26,780 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-06-11 14:32:26,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:26,788 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-06-11 14:32:26,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:26,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:26,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:26,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062710553] [2021-06-11 14:32:26,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:26,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 14:32:26,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177529590] [2021-06-11 14:32:26,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 14:32:26,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 14:32:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 14:32:26,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 335 [2021-06-11 14:32:26,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 303 transitions, 6650 flow. Second operand has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:26,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:26,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 335 [2021-06-11 14:32:26,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:27,610 INFO L129 PetriNetUnfolder]: 1111/2909 cut-off events. [2021-06-11 14:32:27,610 INFO L130 PetriNetUnfolder]: For 100600/100696 co-relation queries the response was YES. [2021-06-11 14:32:27,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22720 conditions, 2909 events. 1111/2909 cut-off events. For 100600/100696 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25075 event pairs, 123 based on Foata normal form. 92/2696 useless extension candidates. Maximal degree in co-relation 22453. Up to 915 conditions per place. [2021-06-11 14:32:27,642 INFO L132 encePairwiseOnDemand]: 311/335 looper letters, 202 selfloop transitions, 132 changer transitions 16/371 dead transitions. [2021-06-11 14:32:27,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 371 transitions, 8245 flow [2021-06-11 14:32:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-11 14:32:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-11 14:32:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2627 transitions. [2021-06-11 14:32:27,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5601279317697229 [2021-06-11 14:32:27,644 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2627 transitions. [2021-06-11 14:32:27,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2627 transitions. [2021-06-11 14:32:27,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:27,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2627 transitions. [2021-06-11 14:32:27,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 187.64285714285714) internal successors, (2627), 14 states have internal predecessors, (2627), 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) [2021-06-11 14:32:27,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 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) [2021-06-11 14:32:27,648 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 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) [2021-06-11 14:32:27,648 INFO L185 Difference]: Start difference. First operand has 266 places, 303 transitions, 6650 flow. Second operand 14 states and 2627 transitions. [2021-06-11 14:32:27,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 371 transitions, 8245 flow [2021-06-11 14:32:28,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 371 transitions, 8092 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-06-11 14:32:28,019 INFO L241 Difference]: Finished difference. Result has 276 places, 295 transitions, 6596 flow [2021-06-11 14:32:28,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=6436, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6596, PETRI_PLACES=276, PETRI_TRANSITIONS=295} [2021-06-11 14:32:28,020 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 211 predicate places. [2021-06-11 14:32:28,020 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:28,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 295 transitions, 6596 flow [2021-06-11 14:32:28,020 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 295 transitions, 6596 flow [2021-06-11 14:32:28,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 275 places, 295 transitions, 6596 flow [2021-06-11 14:32:28,240 INFO L129 PetriNetUnfolder]: 618/2034 cut-off events. [2021-06-11 14:32:28,241 INFO L130 PetriNetUnfolder]: For 79381/79512 co-relation queries the response was YES. [2021-06-11 14:32:28,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15461 conditions, 2034 events. 618/2034 cut-off events. For 79381/79512 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 18859 event pairs, 33 based on Foata normal form. 31/1914 useless extension candidates. Maximal degree in co-relation 15216. Up to 374 conditions per place. [2021-06-11 14:32:28,278 INFO L151 LiptonReduction]: Number of co-enabled transitions 2864 [2021-06-11 14:32:28,299 INFO L163 LiptonReduction]: Checked pairs total: 29 [2021-06-11 14:32:28,300 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:28,300 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 280 [2021-06-11 14:32:28,300 INFO L480 AbstractCegarLoop]: Abstraction has has 275 places, 295 transitions, 6596 flow [2021-06-11 14:32:28,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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) [2021-06-11 14:32:28,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:28,301 INFO L263 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] [2021-06-11 14:32:28,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-11 14:32:28,301 INFO L428 AbstractCegarLoop]: === Iteration 30 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:28,301 INFO L82 PathProgramCache]: Analyzing trace with hash -704568963, now seen corresponding path program 1 times [2021-06-11 14:32:28,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:28,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248736416] [2021-06-11 14:32:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:28,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:28,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:28,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:28,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:28,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:28,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:28,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:28,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:28,328 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-06-11 14:32:28,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:28,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:28,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:28,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248736416] [2021-06-11 14:32:28,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:28,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:32:28,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128853832] [2021-06-11 14:32:28,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 14:32:28,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 14:32:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 14:32:28,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 335 [2021-06-11 14:32:28,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 295 transitions, 6596 flow. Second operand has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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) [2021-06-11 14:32:28,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:28,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 335 [2021-06-11 14:32:28,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:28,751 INFO L129 PetriNetUnfolder]: 667/2189 cut-off events. [2021-06-11 14:32:28,751 INFO L130 PetriNetUnfolder]: For 87975/88152 co-relation queries the response was YES. [2021-06-11 14:32:28,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17195 conditions, 2189 events. 667/2189 cut-off events. For 87975/88152 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 20257 event pairs, 31 based on Foata normal form. 49/2070 useless extension candidates. Maximal degree in co-relation 16929. Up to 564 conditions per place. [2021-06-11 14:32:28,775 INFO L132 encePairwiseOnDemand]: 317/335 looper letters, 41 selfloop transitions, 53 changer transitions 33/310 dead transitions. [2021-06-11 14:32:28,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 310 transitions, 7048 flow [2021-06-11 14:32:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2240 transitions. [2021-06-11 14:32:28,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7429519071310116 [2021-06-11 14:32:28,777 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2240 transitions. [2021-06-11 14:32:28,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2240 transitions. [2021-06-11 14:32:28,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:28,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2240 transitions. [2021-06-11 14:32:28,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 248.88888888888889) internal successors, (2240), 9 states have internal predecessors, (2240), 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) [2021-06-11 14:32:28,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:28,780 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:28,780 INFO L185 Difference]: Start difference. First operand has 275 places, 295 transitions, 6596 flow. Second operand 9 states and 2240 transitions. [2021-06-11 14:32:28,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 310 transitions, 7048 flow [2021-06-11 14:32:29,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 310 transitions, 6514 flow, removed 10 selfloop flow, removed 21 redundant places. [2021-06-11 14:32:29,087 INFO L241 Difference]: Finished difference. Result has 264 places, 275 transitions, 5885 flow [2021-06-11 14:32:29,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=6062, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5885, PETRI_PLACES=264, PETRI_TRANSITIONS=275} [2021-06-11 14:32:29,087 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 199 predicate places. [2021-06-11 14:32:29,087 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:29,087 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 275 transitions, 5885 flow [2021-06-11 14:32:29,087 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 275 transitions, 5885 flow [2021-06-11 14:32:29,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 262 places, 275 transitions, 5885 flow [2021-06-11 14:32:29,283 INFO L129 PetriNetUnfolder]: 555/1901 cut-off events. [2021-06-11 14:32:29,283 INFO L130 PetriNetUnfolder]: For 73087/73189 co-relation queries the response was YES. [2021-06-11 14:32:29,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14676 conditions, 1901 events. 555/1901 cut-off events. For 73087/73189 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17707 event pairs, 27 based on Foata normal form. 19/1791 useless extension candidates. Maximal degree in co-relation 14428. Up to 364 conditions per place. [2021-06-11 14:32:29,317 INFO L151 LiptonReduction]: Number of co-enabled transitions 2726 [2021-06-11 14:32:29,347 INFO L163 LiptonReduction]: Checked pairs total: 25 [2021-06-11 14:32:29,347 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:29,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 261 [2021-06-11 14:32:29,348 INFO L480 AbstractCegarLoop]: Abstraction has has 262 places, 275 transitions, 5885 flow [2021-06-11 14:32:29,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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) [2021-06-11 14:32:29,348 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:29,348 INFO L263 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] [2021-06-11 14:32:29,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-11 14:32:29,348 INFO L428 AbstractCegarLoop]: === Iteration 31 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1549446032, now seen corresponding path program 1 times [2021-06-11 14:32:29,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:29,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546060705] [2021-06-11 14:32:29,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:29,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:29,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:29,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:29,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:29,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:29,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:29,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:29,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546060705] [2021-06-11 14:32:29,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:29,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:29,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935418828] [2021-06-11 14:32:29,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:29,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:29,383 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 335 [2021-06-11 14:32:29,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 275 transitions, 5885 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:29,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:29,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 335 [2021-06-11 14:32:29,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:29,836 INFO L129 PetriNetUnfolder]: 842/2368 cut-off events. [2021-06-11 14:32:29,836 INFO L130 PetriNetUnfolder]: For 87784/87988 co-relation queries the response was YES. [2021-06-11 14:32:29,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18541 conditions, 2368 events. 842/2368 cut-off events. For 87784/87988 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20379 event pairs, 40 based on Foata normal form. 39/2159 useless extension candidates. Maximal degree in co-relation 18287. Up to 475 conditions per place. [2021-06-11 14:32:29,858 INFO L132 encePairwiseOnDemand]: 322/335 looper letters, 114 selfloop transitions, 47 changer transitions 86/342 dead transitions. [2021-06-11 14:32:29,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 342 transitions, 7159 flow [2021-06-11 14:32:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1979 transitions. [2021-06-11 14:32:29,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6563847429519072 [2021-06-11 14:32:29,860 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1979 transitions. [2021-06-11 14:32:29,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1979 transitions. [2021-06-11 14:32:29,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:29,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1979 transitions. [2021-06-11 14:32:29,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 219.88888888888889) internal successors, (1979), 9 states have internal predecessors, (1979), 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) [2021-06-11 14:32:29,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:29,863 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:29,863 INFO L185 Difference]: Start difference. First operand has 262 places, 275 transitions, 5885 flow. Second operand 9 states and 1979 transitions. [2021-06-11 14:32:29,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 342 transitions, 7159 flow [2021-06-11 14:32:30,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 342 transitions, 7006 flow, removed 16 selfloop flow, removed 8 redundant places. [2021-06-11 14:32:30,120 INFO L241 Difference]: Finished difference. Result has 266 places, 220 transitions, 4321 flow [2021-06-11 14:32:30,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=5749, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4321, PETRI_PLACES=266, PETRI_TRANSITIONS=220} [2021-06-11 14:32:30,121 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 201 predicate places. [2021-06-11 14:32:30,121 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:30,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 220 transitions, 4321 flow [2021-06-11 14:32:30,121 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 220 transitions, 4321 flow [2021-06-11 14:32:30,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 259 places, 220 transitions, 4321 flow [2021-06-11 14:32:30,270 INFO L129 PetriNetUnfolder]: 463/1613 cut-off events. [2021-06-11 14:32:30,270 INFO L130 PetriNetUnfolder]: For 47691/47765 co-relation queries the response was YES. [2021-06-11 14:32:30,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11055 conditions, 1613 events. 463/1613 cut-off events. For 47691/47765 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14212 event pairs, 51 based on Foata normal form. 10/1490 useless extension candidates. Maximal degree in co-relation 10803. Up to 249 conditions per place. [2021-06-11 14:32:30,296 INFO L151 LiptonReduction]: Number of co-enabled transitions 2152 [2021-06-11 14:32:30,309 INFO L163 LiptonReduction]: Checked pairs total: 25 [2021-06-11 14:32:30,309 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:30,309 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 188 [2021-06-11 14:32:30,309 INFO L480 AbstractCegarLoop]: Abstraction has has 259 places, 220 transitions, 4321 flow [2021-06-11 14:32:30,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:30,309 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:30,309 INFO L263 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] [2021-06-11 14:32:30,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-11 14:32:30,310 INFO L428 AbstractCegarLoop]: === Iteration 32 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash 301090637, now seen corresponding path program 1 times [2021-06-11 14:32:30,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:30,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286904855] [2021-06-11 14:32:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:30,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:30,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:30,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:30,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:30,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:30,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:30,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286904855] [2021-06-11 14:32:30,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:30,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:30,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612597929] [2021-06-11 14:32:30,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:30,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:30,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 335 [2021-06-11 14:32:30,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 220 transitions, 4321 flow. Second operand has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:30,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:30,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 335 [2021-06-11 14:32:30,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:30,690 INFO L129 PetriNetUnfolder]: 688/1961 cut-off events. [2021-06-11 14:32:30,690 INFO L130 PetriNetUnfolder]: For 53460/53538 co-relation queries the response was YES. [2021-06-11 14:32:30,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13984 conditions, 1961 events. 688/1961 cut-off events. For 53460/53538 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15881 event pairs, 52 based on Foata normal form. 15/1764 useless extension candidates. Maximal degree in co-relation 13739. Up to 442 conditions per place. [2021-06-11 14:32:30,707 INFO L132 encePairwiseOnDemand]: 326/335 looper letters, 96 selfloop transitions, 33 changer transitions 78/280 dead transitions. [2021-06-11 14:32:30,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 280 transitions, 5433 flow [2021-06-11 14:32:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1977 transitions. [2021-06-11 14:32:30,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6557213930348259 [2021-06-11 14:32:30,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1977 transitions. [2021-06-11 14:32:30,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1977 transitions. [2021-06-11 14:32:30,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:30,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1977 transitions. [2021-06-11 14:32:30,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 219.66666666666666) internal successors, (1977), 9 states have internal predecessors, (1977), 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) [2021-06-11 14:32:30,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:30,712 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:30,712 INFO L185 Difference]: Start difference. First operand has 259 places, 220 transitions, 4321 flow. Second operand 9 states and 1977 transitions. [2021-06-11 14:32:30,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 280 transitions, 5433 flow [2021-06-11 14:32:30,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 280 transitions, 4780 flow, removed 45 selfloop flow, removed 33 redundant places. [2021-06-11 14:32:30,848 INFO L241 Difference]: Finished difference. Result has 236 places, 173 transitions, 2596 flow [2021-06-11 14:32:30,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=3703, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2596, PETRI_PLACES=236, PETRI_TRANSITIONS=173} [2021-06-11 14:32:30,848 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 171 predicate places. [2021-06-11 14:32:30,848 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:30,848 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 173 transitions, 2596 flow [2021-06-11 14:32:30,848 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 173 transitions, 2596 flow [2021-06-11 14:32:30,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 231 places, 173 transitions, 2596 flow [2021-06-11 14:32:30,941 INFO L129 PetriNetUnfolder]: 341/1138 cut-off events. [2021-06-11 14:32:30,942 INFO L130 PetriNetUnfolder]: For 15213/15252 co-relation queries the response was YES. [2021-06-11 14:32:30,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 1138 events. 341/1138 cut-off events. For 15213/15252 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8791 event pairs, 58 based on Foata normal form. 8/1023 useless extension candidates. Maximal degree in co-relation 6167. Up to 184 conditions per place. [2021-06-11 14:32:30,958 INFO L151 LiptonReduction]: Number of co-enabled transitions 1664 [2021-06-11 14:32:30,970 INFO L163 LiptonReduction]: Checked pairs total: 25 [2021-06-11 14:32:30,970 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:30,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-06-11 14:32:30,971 INFO L480 AbstractCegarLoop]: Abstraction has has 231 places, 173 transitions, 2596 flow [2021-06-11 14:32:30,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:30,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:30,971 INFO L263 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] [2021-06-11 14:32:30,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-11 14:32:30,971 INFO L428 AbstractCegarLoop]: === Iteration 33 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 848106169, now seen corresponding path program 1 times [2021-06-11 14:32:30,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:30,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214387990] [2021-06-11 14:32:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:30,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:30,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:30,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:30,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:31,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:31,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:31,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:31,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:31,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:31,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:31,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214387990] [2021-06-11 14:32:31,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:31,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:31,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161612274] [2021-06-11 14:32:31,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:31,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:31,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:31,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:31,014 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 335 [2021-06-11 14:32:31,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 173 transitions, 2596 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:31,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:31,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 335 [2021-06-11 14:32:31,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:31,293 INFO L129 PetriNetUnfolder]: 627/1563 cut-off events. [2021-06-11 14:32:31,293 INFO L130 PetriNetUnfolder]: For 21130/21186 co-relation queries the response was YES. [2021-06-11 14:32:31,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9497 conditions, 1563 events. 627/1563 cut-off events. For 21130/21186 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10840 event pairs, 83 based on Foata normal form. 18/1358 useless extension candidates. Maximal degree in co-relation 9411. Up to 323 conditions per place. [2021-06-11 14:32:31,304 INFO L132 encePairwiseOnDemand]: 324/335 looper letters, 90 selfloop transitions, 35 changer transitions 51/241 dead transitions. [2021-06-11 14:32:31,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 241 transitions, 3860 flow [2021-06-11 14:32:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1965 transitions. [2021-06-11 14:32:31,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6517412935323383 [2021-06-11 14:32:31,306 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1965 transitions. [2021-06-11 14:32:31,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1965 transitions. [2021-06-11 14:32:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:31,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1965 transitions. [2021-06-11 14:32:31,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 218.33333333333334) internal successors, (1965), 9 states have internal predecessors, (1965), 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) [2021-06-11 14:32:31,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:31,309 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 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) [2021-06-11 14:32:31,309 INFO L185 Difference]: Start difference. First operand has 231 places, 173 transitions, 2596 flow. Second operand 9 states and 1965 transitions. [2021-06-11 14:32:31,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 241 transitions, 3860 flow [2021-06-11 14:32:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 241 transitions, 3299 flow, removed 37 selfloop flow, removed 49 redundant places. [2021-06-11 14:32:31,352 INFO L241 Difference]: Finished difference. Result has 195 places, 162 transitions, 2104 flow [2021-06-11 14:32:31,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=195, PETRI_TRANSITIONS=162} [2021-06-11 14:32:31,352 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 130 predicate places. [2021-06-11 14:32:31,352 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:31,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 162 transitions, 2104 flow [2021-06-11 14:32:31,352 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 162 transitions, 2104 flow [2021-06-11 14:32:31,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 191 places, 162 transitions, 2104 flow [2021-06-11 14:32:31,414 INFO L129 PetriNetUnfolder]: 268/906 cut-off events. [2021-06-11 14:32:31,414 INFO L130 PetriNetUnfolder]: For 7841/7885 co-relation queries the response was YES. [2021-06-11 14:32:31,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 906 events. 268/906 cut-off events. For 7841/7885 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6608 event pairs, 39 based on Foata normal form. 6/805 useless extension candidates. Maximal degree in co-relation 4565. Up to 163 conditions per place. [2021-06-11 14:32:31,423 INFO L151 LiptonReduction]: Number of co-enabled transitions 1552 [2021-06-11 14:32:31,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:31,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:31,551 INFO L142 QuantifierPusher]: treesize reduction 6, result has 97.8 percent of original size [2021-06-11 14:32:31,570 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:32:32,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:32,133 INFO L142 QuantifierPusher]: treesize reduction 4, result has 97.8 percent of original size [2021-06-11 14:32:32,147 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:32:32,177 INFO L163 LiptonReduction]: Checked pairs total: 710 [2021-06-11 14:32:32,177 INFO L165 LiptonReduction]: Total number of compositions: 9 [2021-06-11 14:32:32,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 825 [2021-06-11 14:32:32,177 INFO L480 AbstractCegarLoop]: Abstraction has has 190 places, 161 transitions, 2120 flow [2021-06-11 14:32:32,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:32,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:32,178 INFO L263 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] [2021-06-11 14:32:32,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-11 14:32:32,178 INFO L428 AbstractCegarLoop]: === Iteration 34 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:32,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash 726006096, now seen corresponding path program 1 times [2021-06-11 14:32:32,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:32,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911084552] [2021-06-11 14:32:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:32,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:32,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:32,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:32,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:32,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:32,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:32,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:32,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911084552] [2021-06-11 14:32:32,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:32,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:32,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647953204] [2021-06-11 14:32:32,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:32,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:32,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 344 [2021-06-11 14:32:32,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 161 transitions, 2120 flow. Second operand has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:32,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:32,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 344 [2021-06-11 14:32:32,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:32,498 INFO L129 PetriNetUnfolder]: 550/1379 cut-off events. [2021-06-11 14:32:32,498 INFO L130 PetriNetUnfolder]: For 13376/13435 co-relation queries the response was YES. [2021-06-11 14:32:32,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8002 conditions, 1379 events. 550/1379 cut-off events. For 13376/13435 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9299 event pairs, 76 based on Foata normal form. 28/1187 useless extension candidates. Maximal degree in co-relation 7940. Up to 284 conditions per place. [2021-06-11 14:32:32,507 INFO L132 encePairwiseOnDemand]: 326/344 looper letters, 79 selfloop transitions, 36 changer transitions 68/229 dead transitions. [2021-06-11 14:32:32,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 229 transitions, 3365 flow [2021-06-11 14:32:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 14:32:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 14:32:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1982 transitions. [2021-06-11 14:32:32,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6401808785529716 [2021-06-11 14:32:32,509 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1982 transitions. [2021-06-11 14:32:32,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1982 transitions. [2021-06-11 14:32:32,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:32,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1982 transitions. [2021-06-11 14:32:32,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 220.22222222222223) internal successors, (1982), 9 states have internal predecessors, (1982), 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) [2021-06-11 14:32:32,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 344.0) internal successors, (3440), 10 states have internal predecessors, (3440), 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) [2021-06-11 14:32:32,516 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 344.0) internal successors, (3440), 10 states have internal predecessors, (3440), 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) [2021-06-11 14:32:32,516 INFO L185 Difference]: Start difference. First operand has 190 places, 161 transitions, 2120 flow. Second operand 9 states and 1982 transitions. [2021-06-11 14:32:32,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 229 transitions, 3365 flow [2021-06-11 14:32:32,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 229 transitions, 3161 flow, removed 32 selfloop flow, removed 15 redundant places. [2021-06-11 14:32:32,553 INFO L241 Difference]: Finished difference. Result has 188 places, 135 transitions, 1760 flow [2021-06-11 14:32:32,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1760, PETRI_PLACES=188, PETRI_TRANSITIONS=135} [2021-06-11 14:32:32,553 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 123 predicate places. [2021-06-11 14:32:32,554 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:32,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 135 transitions, 1760 flow [2021-06-11 14:32:32,554 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 135 transitions, 1760 flow [2021-06-11 14:32:32,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 135 transitions, 1760 flow [2021-06-11 14:32:32,597 INFO L129 PetriNetUnfolder]: 197/632 cut-off events. [2021-06-11 14:32:32,597 INFO L130 PetriNetUnfolder]: For 6256/6325 co-relation queries the response was YES. [2021-06-11 14:32:32,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 632 events. 197/632 cut-off events. For 6256/6325 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4094 event pairs, 55 based on Foata normal form. 12/552 useless extension candidates. Maximal degree in co-relation 3650. Up to 163 conditions per place. [2021-06-11 14:32:32,604 INFO L151 LiptonReduction]: Number of co-enabled transitions 1158 [2021-06-11 14:32:32,696 INFO L142 QuantifierPusher]: treesize reduction 5, result has 97.8 percent of original size [2021-06-11 14:32:32,717 INFO L147 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size 1 [2021-06-11 14:32:33,121 INFO L163 LiptonReduction]: Checked pairs total: 412 [2021-06-11 14:32:33,122 INFO L165 LiptonReduction]: Total number of compositions: 5 [2021-06-11 14:32:33,122 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 568 [2021-06-11 14:32:33,122 INFO L480 AbstractCegarLoop]: Abstraction has has 174 places, 134 transitions, 1766 flow [2021-06-11 14:32:33,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:33,122 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:33,122 INFO L263 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] [2021-06-11 14:32:33,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-11 14:32:33,123 INFO L428 AbstractCegarLoop]: === Iteration 35 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1933944660, now seen corresponding path program 1 times [2021-06-11 14:32:33,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:33,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512575427] [2021-06-11 14:32:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:33,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:33,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:33,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512575427] [2021-06-11 14:32:33,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:33,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:32:33,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239378998] [2021-06-11 14:32:33,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 14:32:33,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 14:32:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 14:32:33,154 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 349 [2021-06-11 14:32:33,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 134 transitions, 1766 flow. Second operand has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 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) [2021-06-11 14:32:33,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:33,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 349 [2021-06-11 14:32:33,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:33,347 INFO L129 PetriNetUnfolder]: 394/975 cut-off events. [2021-06-11 14:32:33,347 INFO L130 PetriNetUnfolder]: For 11272/11378 co-relation queries the response was YES. [2021-06-11 14:32:33,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6412 conditions, 975 events. 394/975 cut-off events. For 11272/11378 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6168 event pairs, 101 based on Foata normal form. 9/800 useless extension candidates. Maximal degree in co-relation 6353. Up to 272 conditions per place. [2021-06-11 14:32:33,353 INFO L132 encePairwiseOnDemand]: 333/349 looper letters, 97 selfloop transitions, 24 changer transitions 18/185 dead transitions. [2021-06-11 14:32:33,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 185 transitions, 2880 flow [2021-06-11 14:32:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 14:32:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 14:32:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1554 transitions. [2021-06-11 14:32:33,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6361031518624641 [2021-06-11 14:32:33,355 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1554 transitions. [2021-06-11 14:32:33,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1554 transitions. [2021-06-11 14:32:33,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:33,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1554 transitions. [2021-06-11 14:32:33,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 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) [2021-06-11 14:32:33,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 349.0) internal successors, (2792), 8 states have internal predecessors, (2792), 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) [2021-06-11 14:32:33,358 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 349.0) internal successors, (2792), 8 states have internal predecessors, (2792), 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) [2021-06-11 14:32:33,358 INFO L185 Difference]: Start difference. First operand has 174 places, 134 transitions, 1766 flow. Second operand 7 states and 1554 transitions. [2021-06-11 14:32:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 185 transitions, 2880 flow [2021-06-11 14:32:33,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 185 transitions, 2785 flow, removed 26 selfloop flow, removed 6 redundant places. [2021-06-11 14:32:33,383 INFO L241 Difference]: Finished difference. Result has 179 places, 145 transitions, 1996 flow [2021-06-11 14:32:33,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1996, PETRI_PLACES=179, PETRI_TRANSITIONS=145} [2021-06-11 14:32:33,383 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 114 predicate places. [2021-06-11 14:32:33,383 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:33,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 145 transitions, 1996 flow [2021-06-11 14:32:33,384 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 145 transitions, 1996 flow [2021-06-11 14:32:33,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 145 transitions, 1996 flow [2021-06-11 14:32:33,437 INFO L129 PetriNetUnfolder]: 230/728 cut-off events. [2021-06-11 14:32:33,437 INFO L130 PetriNetUnfolder]: For 8545/8634 co-relation queries the response was YES. [2021-06-11 14:32:33,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 728 events. 230/728 cut-off events. For 8545/8634 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4923 event pairs, 56 based on Foata normal form. 22/643 useless extension candidates. Maximal degree in co-relation 4358. Up to 195 conditions per place. [2021-06-11 14:32:33,446 INFO L151 LiptonReduction]: Number of co-enabled transitions 1092 [2021-06-11 14:32:33,459 INFO L163 LiptonReduction]: Checked pairs total: 33 [2021-06-11 14:32:33,460 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:33,460 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77 [2021-06-11 14:32:33,460 INFO L480 AbstractCegarLoop]: Abstraction has has 179 places, 145 transitions, 1996 flow [2021-06-11 14:32:33,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 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) [2021-06-11 14:32:33,460 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:33,460 INFO L263 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] [2021-06-11 14:32:33,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-11 14:32:33,461 INFO L428 AbstractCegarLoop]: === Iteration 36 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash -723646529, now seen corresponding path program 1 times [2021-06-11 14:32:33,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:33,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125035902] [2021-06-11 14:32:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:33,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:33,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:33,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:33,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125035902] [2021-06-11 14:32:33,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:33,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 14:32:33,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880144727] [2021-06-11 14:32:33,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 14:32:33,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 14:32:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 14:32:33,496 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 349 [2021-06-11 14:32:33,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 145 transitions, 1996 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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) [2021-06-11 14:32:33,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:33,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 349 [2021-06-11 14:32:33,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:33,723 INFO L129 PetriNetUnfolder]: 405/1020 cut-off events. [2021-06-11 14:32:33,723 INFO L130 PetriNetUnfolder]: For 13684/13773 co-relation queries the response was YES. [2021-06-11 14:32:33,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6961 conditions, 1020 events. 405/1020 cut-off events. For 13684/13773 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6558 event pairs, 111 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 6897. Up to 284 conditions per place. [2021-06-11 14:32:33,731 INFO L132 encePairwiseOnDemand]: 333/349 looper letters, 99 selfloop transitions, 24 changer transitions 21/190 dead transitions. [2021-06-11 14:32:33,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 190 transitions, 3026 flow [2021-06-11 14:32:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 14:32:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 14:32:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1561 transitions. [2021-06-11 14:32:33,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6389684813753582 [2021-06-11 14:32:33,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1561 transitions. [2021-06-11 14:32:33,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1561 transitions. [2021-06-11 14:32:33,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:33,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1561 transitions. [2021-06-11 14:32:33,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 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) [2021-06-11 14:32:33,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 349.0) internal successors, (2792), 8 states have internal predecessors, (2792), 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) [2021-06-11 14:32:33,735 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 349.0) internal successors, (2792), 8 states have internal predecessors, (2792), 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) [2021-06-11 14:32:33,735 INFO L185 Difference]: Start difference. First operand has 179 places, 145 transitions, 1996 flow. Second operand 7 states and 1561 transitions. [2021-06-11 14:32:33,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 190 transitions, 3026 flow [2021-06-11 14:32:33,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 190 transitions, 2964 flow, removed 26 selfloop flow, removed 1 redundant places. [2021-06-11 14:32:33,800 INFO L241 Difference]: Finished difference. Result has 188 places, 148 transitions, 2075 flow [2021-06-11 14:32:33,800 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2075, PETRI_PLACES=188, PETRI_TRANSITIONS=148} [2021-06-11 14:32:33,800 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 123 predicate places. [2021-06-11 14:32:33,800 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:33,801 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 148 transitions, 2075 flow [2021-06-11 14:32:33,802 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 148 transitions, 2075 flow [2021-06-11 14:32:33,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 148 transitions, 2075 flow [2021-06-11 14:32:33,886 INFO L129 PetriNetUnfolder]: 227/729 cut-off events. [2021-06-11 14:32:33,886 INFO L130 PetriNetUnfolder]: For 9328/9447 co-relation queries the response was YES. [2021-06-11 14:32:33,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4568 conditions, 729 events. 227/729 cut-off events. For 9328/9447 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4948 event pairs, 54 based on Foata normal form. 24/643 useless extension candidates. Maximal degree in co-relation 4501. Up to 199 conditions per place. [2021-06-11 14:32:33,896 INFO L151 LiptonReduction]: Number of co-enabled transitions 1114 [2021-06-11 14:32:33,904 INFO L163 LiptonReduction]: Checked pairs total: 35 [2021-06-11 14:32:33,904 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:33,905 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-06-11 14:32:33,906 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 148 transitions, 2075 flow [2021-06-11 14:32:33,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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) [2021-06-11 14:32:33,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:33,906 INFO L263 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] [2021-06-11 14:32:33,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-11 14:32:33,906 INFO L428 AbstractCegarLoop]: === Iteration 37 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash 728631063, now seen corresponding path program 2 times [2021-06-11 14:32:33,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:33,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934109066] [2021-06-11 14:32:33,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:33,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:33,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:33,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:33,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:33,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:33,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934109066] [2021-06-11 14:32:33,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:33,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:32:33,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220404064] [2021-06-11 14:32:33,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 14:32:33,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 14:32:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 14:32:33,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 349 [2021-06-11 14:32:33,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 148 transitions, 2075 flow. Second operand has 4 states, 4 states have (on average 264.5) internal successors, (1058), 4 states have internal predecessors, (1058), 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) [2021-06-11 14:32:33,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:33,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 349 [2021-06-11 14:32:33,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:34,074 INFO L129 PetriNetUnfolder]: 351/954 cut-off events. [2021-06-11 14:32:34,074 INFO L130 PetriNetUnfolder]: For 12061/12140 co-relation queries the response was YES. [2021-06-11 14:32:34,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 954 events. 351/954 cut-off events. For 12061/12140 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6336 event pairs, 81 based on Foata normal form. 30/810 useless extension candidates. Maximal degree in co-relation 6415. Up to 257 conditions per place. [2021-06-11 14:32:34,082 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 61 selfloop transitions, 7 changer transitions 18/160 dead transitions. [2021-06-11 14:32:34,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 160 transitions, 2455 flow [2021-06-11 14:32:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 14:32:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 14:32:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1083 transitions. [2021-06-11 14:32:34,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7757879656160458 [2021-06-11 14:32:34,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1083 transitions. [2021-06-11 14:32:34,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1083 transitions. [2021-06-11 14:32:34,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:34,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1083 transitions. [2021-06-11 14:32:34,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 270.75) internal successors, (1083), 4 states have internal predecessors, (1083), 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) [2021-06-11 14:32:34,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 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) [2021-06-11 14:32:34,085 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 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) [2021-06-11 14:32:34,085 INFO L185 Difference]: Start difference. First operand has 188 places, 148 transitions, 2075 flow. Second operand 4 states and 1083 transitions. [2021-06-11 14:32:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 160 transitions, 2455 flow [2021-06-11 14:32:34,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 160 transitions, 2389 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-06-11 14:32:34,125 INFO L241 Difference]: Finished difference. Result has 191 places, 138 transitions, 1881 flow [2021-06-11 14:32:34,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1881, PETRI_PLACES=191, PETRI_TRANSITIONS=138} [2021-06-11 14:32:34,126 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 126 predicate places. [2021-06-11 14:32:34,126 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:34,126 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 138 transitions, 1881 flow [2021-06-11 14:32:34,126 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 138 transitions, 1881 flow [2021-06-11 14:32:34,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 138 transitions, 1881 flow [2021-06-11 14:32:34,177 INFO L129 PetriNetUnfolder]: 184/654 cut-off events. [2021-06-11 14:32:34,177 INFO L130 PetriNetUnfolder]: For 8206/8309 co-relation queries the response was YES. [2021-06-11 14:32:34,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4003 conditions, 654 events. 184/654 cut-off events. For 8206/8309 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4435 event pairs, 41 based on Foata normal form. 23/596 useless extension candidates. Maximal degree in co-relation 3935. Up to 181 conditions per place. [2021-06-11 14:32:34,184 INFO L151 LiptonReduction]: Number of co-enabled transitions 988 [2021-06-11 14:32:34,189 INFO L163 LiptonReduction]: Checked pairs total: 26 [2021-06-11 14:32:34,189 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:34,189 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-06-11 14:32:34,189 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 138 transitions, 1881 flow [2021-06-11 14:32:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 264.5) internal successors, (1058), 4 states have internal predecessors, (1058), 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) [2021-06-11 14:32:34,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:34,190 INFO L263 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] [2021-06-11 14:32:34,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-11 14:32:34,190 INFO L428 AbstractCegarLoop]: === Iteration 38 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1012907360, now seen corresponding path program 1 times [2021-06-11 14:32:34,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:34,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515419866] [2021-06-11 14:32:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:34,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:34,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:34,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:34,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:34,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515419866] [2021-06-11 14:32:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 14:32:34,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426476705] [2021-06-11 14:32:34,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 14:32:34,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 14:32:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 14:32:34,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 349 [2021-06-11 14:32:34,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 138 transitions, 1881 flow. Second operand has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 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) [2021-06-11 14:32:34,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:34,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 349 [2021-06-11 14:32:34,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:34,321 INFO L129 PetriNetUnfolder]: 277/819 cut-off events. [2021-06-11 14:32:34,321 INFO L130 PetriNetUnfolder]: For 10816/10907 co-relation queries the response was YES. [2021-06-11 14:32:34,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 819 events. 277/819 cut-off events. For 10816/10907 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5480 event pairs, 63 based on Foata normal form. 22/702 useless extension candidates. Maximal degree in co-relation 5532. Up to 253 conditions per place. [2021-06-11 14:32:34,327 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 52 selfloop transitions, 4 changer transitions 19/147 dead transitions. [2021-06-11 14:32:34,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 147 transitions, 2204 flow [2021-06-11 14:32:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 14:32:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 14:32:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1075 transitions. [2021-06-11 14:32:34,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7700573065902578 [2021-06-11 14:32:34,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1075 transitions. [2021-06-11 14:32:34,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1075 transitions. [2021-06-11 14:32:34,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:34,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1075 transitions. [2021-06-11 14:32:34,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 268.75) internal successors, (1075), 4 states have internal predecessors, (1075), 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) [2021-06-11 14:32:34,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 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) [2021-06-11 14:32:34,330 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 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) [2021-06-11 14:32:34,330 INFO L185 Difference]: Start difference. First operand has 188 places, 138 transitions, 1881 flow. Second operand 4 states and 1075 transitions. [2021-06-11 14:32:34,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 147 transitions, 2204 flow [2021-06-11 14:32:34,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 147 transitions, 2151 flow, removed 18 selfloop flow, removed 6 redundant places. [2021-06-11 14:32:34,362 INFO L241 Difference]: Finished difference. Result has 187 places, 127 transitions, 1674 flow [2021-06-11 14:32:34,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1674, PETRI_PLACES=187, PETRI_TRANSITIONS=127} [2021-06-11 14:32:34,363 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 122 predicate places. [2021-06-11 14:32:34,363 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:34,363 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 127 transitions, 1674 flow [2021-06-11 14:32:34,363 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 127 transitions, 1674 flow [2021-06-11 14:32:34,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 183 places, 127 transitions, 1674 flow [2021-06-11 14:32:34,396 INFO L129 PetriNetUnfolder]: 114/452 cut-off events. [2021-06-11 14:32:34,396 INFO L130 PetriNetUnfolder]: For 5613/5667 co-relation queries the response was YES. [2021-06-11 14:32:34,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 452 events. 114/452 cut-off events. For 5613/5667 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2714 event pairs, 13 based on Foata normal form. 12/420 useless extension candidates. Maximal degree in co-relation 2665. Up to 89 conditions per place. [2021-06-11 14:32:34,401 INFO L151 LiptonReduction]: Number of co-enabled transitions 850 [2021-06-11 14:32:34,405 INFO L163 LiptonReduction]: Checked pairs total: 17 [2021-06-11 14:32:34,405 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:34,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-06-11 14:32:34,405 INFO L480 AbstractCegarLoop]: Abstraction has has 183 places, 127 transitions, 1674 flow [2021-06-11 14:32:34,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 263.5) internal successors, (1054), 4 states have internal predecessors, (1054), 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) [2021-06-11 14:32:34,406 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:34,406 INFO L263 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] [2021-06-11 14:32:34,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-11 14:32:34,406 INFO L428 AbstractCegarLoop]: === Iteration 39 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1182057033, now seen corresponding path program 1 times [2021-06-11 14:32:34,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:34,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475180034] [2021-06-11 14:32:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:34,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:34,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:34,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475180034] [2021-06-11 14:32:34,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:34,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:34,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62861508] [2021-06-11 14:32:34,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:34,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:34,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 349 [2021-06-11 14:32:34,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 127 transitions, 1674 flow. Second operand has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:34,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:34,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 349 [2021-06-11 14:32:34,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:34,655 INFO L129 PetriNetUnfolder]: 256/690 cut-off events. [2021-06-11 14:32:34,655 INFO L130 PetriNetUnfolder]: For 8975/9026 co-relation queries the response was YES. [2021-06-11 14:32:34,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4905 conditions, 690 events. 256/690 cut-off events. For 8975/9026 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3935 event pairs, 75 based on Foata normal form. 9/576 useless extension candidates. Maximal degree in co-relation 4836. Up to 252 conditions per place. [2021-06-11 14:32:34,659 INFO L132 encePairwiseOnDemand]: 334/349 looper letters, 42 selfloop transitions, 14 changer transitions 73/162 dead transitions. [2021-06-11 14:32:34,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 162 transitions, 2497 flow [2021-06-11 14:32:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 14:32:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 14:32:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions. [2021-06-11 14:32:34,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6194321437874446 [2021-06-11 14:32:34,668 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions. [2021-06-11 14:32:34,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions. [2021-06-11 14:32:34,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:34,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions. [2021-06-11 14:32:34,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 216.1818181818182) internal successors, (2378), 11 states have internal predecessors, (2378), 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) [2021-06-11 14:32:34,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 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) [2021-06-11 14:32:34,671 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 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) [2021-06-11 14:32:34,671 INFO L185 Difference]: Start difference. First operand has 183 places, 127 transitions, 1674 flow. Second operand 11 states and 2378 transitions. [2021-06-11 14:32:34,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 162 transitions, 2497 flow [2021-06-11 14:32:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 162 transitions, 2322 flow, removed 54 selfloop flow, removed 14 redundant places. [2021-06-11 14:32:34,699 INFO L241 Difference]: Finished difference. Result has 179 places, 83 transitions, 1025 flow [2021-06-11 14:32:34,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1025, PETRI_PLACES=179, PETRI_TRANSITIONS=83} [2021-06-11 14:32:34,699 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 114 predicate places. [2021-06-11 14:32:34,699 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:34,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 83 transitions, 1025 flow [2021-06-11 14:32:34,699 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 83 transitions, 1025 flow [2021-06-11 14:32:34,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 83 transitions, 1025 flow [2021-06-11 14:32:34,715 INFO L129 PetriNetUnfolder]: 64/226 cut-off events. [2021-06-11 14:32:34,716 INFO L130 PetriNetUnfolder]: For 2600/2627 co-relation queries the response was YES. [2021-06-11 14:32:34,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 226 events. 64/226 cut-off events. For 2600/2627 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 943 event pairs, 4 based on Foata normal form. 6/201 useless extension candidates. Maximal degree in co-relation 1465. Up to 75 conditions per place. [2021-06-11 14:32:34,718 INFO L151 LiptonReduction]: Number of co-enabled transitions 502 [2021-06-11 14:32:34,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:34,790 INFO L163 LiptonReduction]: Checked pairs total: 38 [2021-06-11 14:32:34,790 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 14:32:34,790 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-06-11 14:32:34,791 INFO L480 AbstractCegarLoop]: Abstraction has has 158 places, 82 transitions, 1017 flow [2021-06-11 14:32:34,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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) [2021-06-11 14:32:34,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 14:32:34,791 INFO L263 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] [2021-06-11 14:32:34,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-11 14:32:34,791 INFO L428 AbstractCegarLoop]: === Iteration 40 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-11 14:32:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 14:32:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash 447350824, now seen corresponding path program 1 times [2021-06-11 14:32:34,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 14:32:34,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828108486] [2021-06-11 14:32:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 14:32:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 14:32:34,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 14:32:34,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 14:32:34,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 14:32:34,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 14:32:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 14:32:34,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828108486] [2021-06-11 14:32:34,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 14:32:34,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 14:32:34,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408026813] [2021-06-11 14:32:34,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 14:32:34,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 14:32:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 14:32:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 14:32:34,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 351 [2021-06-11 14:32:34,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 82 transitions, 1017 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:34,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 14:32:34,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 351 [2021-06-11 14:32:34,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 14:32:34,965 INFO L129 PetriNetUnfolder]: 150/368 cut-off events. [2021-06-11 14:32:34,965 INFO L130 PetriNetUnfolder]: For 4724/4789 co-relation queries the response was YES. [2021-06-11 14:32:34,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 368 events. 150/368 cut-off events. For 4724/4789 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1538 event pairs, 46 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 2574. Up to 163 conditions per place. [2021-06-11 14:32:34,967 INFO L132 encePairwiseOnDemand]: 340/351 looper letters, 0 selfloop transitions, 0 changer transitions 95/95 dead transitions. [2021-06-11 14:32:34,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 95 transitions, 1374 flow [2021-06-11 14:32:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 14:32:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 14:32:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2136 transitions. [2021-06-11 14:32:34,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6085470085470085 [2021-06-11 14:32:34,969 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2136 transitions. [2021-06-11 14:32:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2136 transitions. [2021-06-11 14:32:34,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 14:32:34,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2136 transitions. [2021-06-11 14:32:34,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 213.6) internal successors, (2136), 10 states have internal predecessors, (2136), 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) [2021-06-11 14:32:34,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 351.0) internal successors, (3861), 11 states have internal predecessors, (3861), 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) [2021-06-11 14:32:34,972 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 351.0) internal successors, (3861), 11 states have internal predecessors, (3861), 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) [2021-06-11 14:32:34,972 INFO L185 Difference]: Start difference. First operand has 158 places, 82 transitions, 1017 flow. Second operand 10 states and 2136 transitions. [2021-06-11 14:32:34,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 95 transitions, 1374 flow [2021-06-11 14:32:34,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 95 transitions, 1041 flow, removed 44 selfloop flow, removed 44 redundant places. [2021-06-11 14:32:34,982 INFO L241 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2021-06-11 14:32:34,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2021-06-11 14:32:34,982 INFO L343 CegarLoopForPetriNet]: 65 programPoint places, 57 predicate places. [2021-06-11 14:32:34,982 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 14:32:34,983 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 0 transitions, 0 flow [2021-06-11 14:32:34,983 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 0 transitions, 0 flow [2021-06-11 14:32:34,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-06-11 14:32:34,983 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-11 14:32:34,983 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 14:32:34,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-06-11 14:32:34,983 INFO L151 LiptonReduction]: Number of co-enabled transitions 0 [2021-06-11 14:32:34,983 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 14:32:34,983 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 14:32:34,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-06-11 14:32:34,984 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-06-11 14:32:34,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-06-11 14:32:34,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-11 14:32:34,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 02:32:34 BasicIcfg [2021-06-11 14:32:34,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 14:32:34,987 INFO L168 Benchmark]: Toolchain (without parser) took 162838.78 ms. Allocated memory was 396.4 MB in the beginning and 13.7 GB in the end (delta: 13.3 GB). Free memory was 358.4 MB in the beginning and 7.2 GB in the end (delta: -6.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 396.4 MB. Free memory is still 376.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.29 ms. Allocated memory is still 396.4 MB. Free memory was 358.2 MB in the beginning and 357.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 396.4 MB. Free memory was 357.0 MB in the beginning and 353.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: Boogie Preprocessor took 27.97 ms. Allocated memory is still 396.4 MB. Free memory was 353.8 MB in the beginning and 351.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: RCFGBuilder took 782.58 ms. Allocated memory is still 396.4 MB. Free memory was 351.7 MB in the beginning and 250.0 MB in the end (delta: 101.7 MB). Peak memory consumption was 102.8 MB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L168 Benchmark]: TraceAbstraction took 161521.60 ms. Allocated memory was 396.4 MB in the beginning and 13.7 GB in the end (delta: 13.3 GB). Free memory was 250.0 MB in the beginning and 7.2 GB in the end (delta: -6.9 GB). Peak memory consumption was 6.3 GB. Max. memory is 16.0 GB. [2021-06-11 14:32:34,987 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 396.4 MB. Free memory is still 376.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 439.29 ms. Allocated memory is still 396.4 MB. Free memory was 358.2 MB in the beginning and 357.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.95 ms. Allocated memory is still 396.4 MB. Free memory was 357.0 MB in the beginning and 353.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.97 ms. Allocated memory is still 396.4 MB. Free memory was 353.8 MB in the beginning and 351.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 782.58 ms. Allocated memory is still 396.4 MB. Free memory was 351.7 MB in the beginning and 250.0 MB in the end (delta: 101.7 MB). Peak memory consumption was 102.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 161521.60 ms. Allocated memory was 396.4 MB in the beginning and 13.7 GB in the end (delta: 13.3 GB). Free memory was 250.0 MB in the beginning and 7.2 GB in the end (delta: -6.9 GB). Peak memory consumption was 6.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6800.6ms, 147 PlacesBefore, 65 PlacesAfterwards, 159 TransitionsBefore, 73 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 7 FixpointIterations, 24 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 124 TotalNumberOfCompositions, 22093 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9175, positive: 8855, positive conditional: 8855, positive unconditional: 0, negative: 320, negative conditional: 320, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9175, positive: 8855, positive conditional: 0, positive unconditional: 8855, negative: 320, negative conditional: 0, negative unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9175, positive: 8855, positive conditional: 0, positive unconditional: 8855, negative: 320, negative conditional: 0, negative unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6558, positive: 6439, positive conditional: 0, positive unconditional: 6439, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6558, positive: 6409, positive conditional: 0, positive unconditional: 6409, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 149, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 597, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 507, negative conditional: 0, negative unconditional: 507, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9175, positive: 2416, positive conditional: 0, positive unconditional: 2416, negative: 201, negative conditional: 0, negative unconditional: 201, unknown: 6558, unknown conditional: 0, unknown unconditional: 6558] , Statistics on independence cache: Total cache size (in pairs): 6558, Positive cache size: 6439, Positive conditional cache size: 0, Positive unconditional cache size: 6439, Negative cache size: 119, Negative conditional cache size: 0, Negative unconditional cache size: 119, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 110.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 2970 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2112 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 325, positive: 277, positive conditional: 277, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 325, positive: 277, positive conditional: 0, positive unconditional: 277, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 325, positive: 277, positive conditional: 0, positive unconditional: 277, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 40, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 325, positive: 255, positive conditional: 0, positive unconditional: 255, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 40, unknown conditional: 0, unknown unconditional: 40] , Statistics on independence cache: Total cache size (in pairs): 6598, Positive cache size: 6461, Positive conditional cache size: 0, Positive unconditional cache size: 6461, Negative cache size: 137, Negative conditional cache size: 0, Negative unconditional cache size: 137, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.5ms, 65 PlacesBefore, 65 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 2948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1996 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 291, positive: 245, positive conditional: 245, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 291, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 46, negative conditional: 2, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 291, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 46, negative conditional: 2, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 9, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 291, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 38, negative conditional: 1, negative unconditional: 37, unknown: 19, unknown conditional: 1, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 6617, Positive cache size: 6472, Positive conditional cache size: 0, Positive unconditional cache size: 6472, Negative cache size: 145, Negative conditional cache size: 1, Negative unconditional cache size: 144, Eliminated conditions: 38 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.9ms, 66 PlacesBefore, 66 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 2926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1876 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, positive: 213, positive conditional: 213, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, positive: 213, positive conditional: 0, positive unconditional: 213, negative: 44, negative conditional: 2, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, positive: 213, positive conditional: 0, positive unconditional: 213, negative: 44, negative conditional: 2, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 9, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 42, negative conditional: 1, negative unconditional: 41, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 6621, Positive cache size: 6474, Positive conditional cache size: 0, Positive unconditional cache size: 6474, Negative cache size: 147, Negative conditional cache size: 2, Negative unconditional cache size: 145, Eliminated conditions: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.6ms, 75 PlacesBefore, 75 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1833 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 341, positive: 308, positive conditional: 308, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 341, positive: 308, positive conditional: 42, positive unconditional: 266, negative: 33, negative conditional: 1, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 341, positive: 308, positive conditional: 42, positive unconditional: 266, negative: 33, negative conditional: 1, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 6, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 341, positive: 287, positive conditional: 42, positive unconditional: 245, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 26, unknown conditional: 1, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 6647, Positive cache size: 6495, Positive conditional cache size: 0, Positive unconditional cache size: 6495, Negative cache size: 152, Negative conditional cache size: 3, Negative unconditional cache size: 149, Eliminated conditions: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.2ms, 87 PlacesBefore, 87 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 4612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2527 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 669, positive: 632, positive conditional: 632, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 669, positive: 632, positive conditional: 150, positive unconditional: 482, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 669, positive: 632, positive conditional: 150, positive unconditional: 482, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 3, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 669, positive: 619, positive conditional: 147, positive unconditional: 472, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 13, unknown conditional: 3, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 6660, Positive cache size: 6508, Positive conditional cache size: 3, Positive unconditional cache size: 6505, Negative cache size: 152, Negative conditional cache size: 3, Negative unconditional cache size: 149, Eliminated conditions: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 190.3ms, 98 PlacesBefore, 98 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 4952 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2784 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 660, positive: 626, positive conditional: 626, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 660, positive: 626, positive conditional: 182, positive unconditional: 444, negative: 34, negative conditional: 10, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 660, positive: 626, positive conditional: 182, positive unconditional: 444, negative: 34, negative conditional: 10, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 2, positive unconditional: 5, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 6, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 660, positive: 619, positive conditional: 180, positive unconditional: 439, negative: 30, negative conditional: 8, negative unconditional: 22, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 6671, Positive cache size: 6515, Positive conditional cache size: 5, Positive unconditional cache size: 6510, Negative cache size: 156, Negative conditional cache size: 5, Negative unconditional cache size: 151, Eliminated conditions: 85 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 452.9ms, 114 PlacesBefore, 114 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 6054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2334 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 514, positive: 487, positive conditional: 487, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 514, positive: 487, positive conditional: 121, positive unconditional: 366, negative: 27, negative conditional: 3, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 514, positive: 487, positive conditional: 121, positive unconditional: 366, negative: 27, negative conditional: 3, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 514, positive: 482, positive conditional: 121, positive unconditional: 361, negative: 26, negative conditional: 2, negative unconditional: 24, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6677, Positive cache size: 6520, Positive conditional cache size: 5, Positive unconditional cache size: 6515, Negative cache size: 157, Negative conditional cache size: 6, Negative unconditional cache size: 151, Eliminated conditions: 88 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1209.7ms, 133 PlacesBefore, 133 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 7486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2688 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 424, positive: 392, positive conditional: 392, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 433, positive: 392, positive conditional: 99, positive unconditional: 293, negative: 41, negative conditional: 18, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 433, positive: 392, positive conditional: 99, positive unconditional: 293, negative: 41, negative conditional: 18, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 1, positive unconditional: 9, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 433, positive: 382, positive conditional: 98, positive unconditional: 284, negative: 39, negative conditional: 16, negative unconditional: 23, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 6689, Positive cache size: 6530, Positive conditional cache size: 6, Positive unconditional cache size: 6524, Negative cache size: 159, Negative conditional cache size: 8, Negative unconditional cache size: 151, Eliminated conditions: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2321.3ms, 137 PlacesBefore, 137 PlacesAfterwards, 278 TransitionsBefore, 278 TransitionsAfterwards, 7684 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3924 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1806, positive: 1760, positive conditional: 1760, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1815, positive: 1760, positive conditional: 496, positive unconditional: 1264, negative: 55, negative conditional: 31, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1815, positive: 1760, positive conditional: 496, positive unconditional: 1264, negative: 55, negative conditional: 31, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 2, positive unconditional: 7, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1815, positive: 1751, positive conditional: 494, positive unconditional: 1257, negative: 51, negative conditional: 27, negative unconditional: 24, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 6702, Positive cache size: 6539, Positive conditional cache size: 8, Positive unconditional cache size: 6531, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 394 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1675.3ms, 141 PlacesBefore, 141 PlacesAfterwards, 282 TransitionsBefore, 282 TransitionsAfterwards, 7732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1928 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, positive: 292, positive conditional: 292, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338, positive: 292, positive conditional: 62, positive unconditional: 230, negative: 46, negative conditional: 36, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338, positive: 292, positive conditional: 62, positive unconditional: 230, negative: 46, negative conditional: 36, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 338, positive: 288, positive conditional: 60, positive unconditional: 228, negative: 46, negative conditional: 36, negative unconditional: 10, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6706, Positive cache size: 6543, Positive conditional cache size: 10, Positive unconditional cache size: 6533, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1770.8ms, 151 PlacesBefore, 151 PlacesAfterwards, 298 TransitionsBefore, 298 TransitionsAfterwards, 8390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 921 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6707, Positive cache size: 6544, Positive conditional cache size: 10, Positive unconditional cache size: 6534, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1918.5ms, 154 PlacesBefore, 154 PlacesAfterwards, 296 TransitionsBefore, 296 TransitionsAfterwards, 8332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 903 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6707, Positive cache size: 6544, Positive conditional cache size: 10, Positive unconditional cache size: 6534, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2057.0ms, 147 PlacesBefore, 147 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 7178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 657 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6707, Positive cache size: 6544, Positive conditional cache size: 10, Positive unconditional cache size: 6534, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2707.9ms, 161 PlacesBefore, 161 PlacesAfterwards, 316 TransitionsBefore, 316 TransitionsAfterwards, 6976 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1302 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, positive: 123, positive conditional: 45, positive unconditional: 78, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, positive: 123, positive conditional: 45, positive unconditional: 78, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, positive: 123, positive conditional: 45, positive unconditional: 78, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6707, Positive cache size: 6544, Positive conditional cache size: 10, Positive unconditional cache size: 6534, Negative cache size: 163, Negative conditional cache size: 12, Negative unconditional cache size: 151, Eliminated conditions: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1003.0ms, 174 PlacesBefore, 166 PlacesAfterwards, 224 TransitionsBefore, 224 TransitionsAfterwards, 5188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 179 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 116, positive conditional: 116, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, positive: 116, positive conditional: 36, positive unconditional: 80, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 116, positive conditional: 36, positive unconditional: 80, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 115, positive conditional: 36, positive unconditional: 79, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6709, Positive cache size: 6545, Positive conditional cache size: 10, Positive unconditional cache size: 6535, Negative cache size: 164, Negative conditional cache size: 13, Negative unconditional cache size: 151, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1511.3ms, 172 PlacesBefore, 172 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 5848 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 318 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, positive: 246, positive conditional: 246, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, positive: 246, positive conditional: 84, positive unconditional: 162, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 246, positive conditional: 84, positive unconditional: 162, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, positive: 244, positive conditional: 84, positive unconditional: 160, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6712, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 165, Negative conditional cache size: 14, Negative unconditional cache size: 151, Eliminated conditions: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1367.0ms, 186 PlacesBefore, 186 PlacesAfterwards, 304 TransitionsBefore, 304 TransitionsAfterwards, 6004 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 39 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6712, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 165, Negative conditional cache size: 14, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4629.6ms, 207 PlacesBefore, 207 PlacesAfterwards, 408 TransitionsBefore, 408 TransitionsAfterwards, 7162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 3519 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3430, positive: 3428, positive conditional: 3428, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3436, positive: 3428, positive conditional: 1533, positive unconditional: 1895, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3436, positive: 3428, positive conditional: 1533, positive unconditional: 1895, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3436, positive: 3428, positive conditional: 1533, positive unconditional: 1895, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6719, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 886 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1727.0ms, 213 PlacesBefore, 213 PlacesAfterwards, 374 TransitionsBefore, 374 TransitionsAfterwards, 6792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 39 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6719, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1380.7ms, 230 PlacesBefore, 218 PlacesAfterwards, 269 TransitionsBefore, 269 TransitionsAfterwards, 4302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 443 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, positive: 374, positive conditional: 374, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 376, positive: 374, positive conditional: 141, positive unconditional: 233, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 376, positive: 374, positive conditional: 141, positive unconditional: 233, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 376, positive: 374, positive conditional: 141, positive unconditional: 233, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6719, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 105 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 969.8ms, 219 PlacesBefore, 219 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 4344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6719, Positive cache size: 6547, Positive conditional cache size: 10, Positive unconditional cache size: 6537, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 932.6ms, 228 PlacesBefore, 228 PlacesAfterwards, 300 TransitionsBefore, 300 TransitionsAfterwards, 4510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6720, Positive cache size: 6548, Positive conditional cache size: 10, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 899.0ms, 245 PlacesBefore, 245 PlacesAfterwards, 320 TransitionsBefore, 320 TransitionsAfterwards, 4592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6720, Positive cache size: 6548, Positive conditional cache size: 10, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1088.8ms, 256 PlacesBefore, 256 PlacesAfterwards, 342 TransitionsBefore, 342 TransitionsAfterwards, 4744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6720, Positive cache size: 6548, Positive conditional cache size: 10, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1065.7ms, 274 PlacesBefore, 274 PlacesAfterwards, 354 TransitionsBefore, 354 TransitionsAfterwards, 4804 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6720, Positive cache size: 6548, Positive conditional cache size: 10, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1017.9ms, 281 PlacesBefore, 276 PlacesAfterwards, 351 TransitionsBefore, 351 TransitionsAfterwards, 4498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6720, Positive cache size: 6548, Positive conditional cache size: 10, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 869.9ms, 287 PlacesBefore, 272 PlacesAfterwards, 296 TransitionsBefore, 296 TransitionsAfterwards, 3198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 706 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 648, positive: 646, positive conditional: 646, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 648, positive: 646, positive conditional: 316, positive unconditional: 330, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 648, positive: 646, positive conditional: 316, positive unconditional: 330, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 648, positive: 643, positive conditional: 313, positive unconditional: 330, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6723, Positive cache size: 6551, Positive conditional cache size: 13, Positive unconditional cache size: 6538, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 176 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 324.9ms, 266 PlacesBefore, 266 PlacesAfterwards, 303 TransitionsBefore, 303 TransitionsAfterwards, 3064 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6724, Positive cache size: 6552, Positive conditional cache size: 13, Positive unconditional cache size: 6539, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 279.7ms, 276 PlacesBefore, 275 PlacesAfterwards, 295 TransitionsBefore, 295 TransitionsAfterwards, 2864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6724, Positive cache size: 6552, Positive conditional cache size: 13, Positive unconditional cache size: 6539, Negative cache size: 172, Negative conditional cache size: 21, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 260.1ms, 264 PlacesBefore, 262 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 2726 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 25 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6725, Positive cache size: 6552, Positive conditional cache size: 13, Positive unconditional cache size: 6539, Negative cache size: 173, Negative conditional cache size: 22, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 187.4ms, 266 PlacesBefore, 259 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 2152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 25 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6725, Positive cache size: 6552, Positive conditional cache size: 13, Positive unconditional cache size: 6539, Negative cache size: 173, Negative conditional cache size: 22, Negative unconditional cache size: 151, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.5ms, 236 PlacesBefore, 231 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 1664 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 25 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6725, Positive cache size: 6552, Positive conditional cache size: 13, Positive unconditional cache size: 6539, Negative cache size: 173, Negative conditional cache size: 22, Negative unconditional cache size: 151, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 824.5ms, 195 PlacesBefore, 190 PlacesAfterwards, 162 TransitionsBefore, 161 TransitionsAfterwards, 1552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 710 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 663, positive: 661, positive conditional: 661, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 664, positive: 661, positive conditional: 330, positive unconditional: 331, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 664, positive: 661, positive conditional: 330, positive unconditional: 331, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 11, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 664, positive: 658, positive conditional: 327, positive unconditional: 331, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6731, Positive cache size: 6555, Positive conditional cache size: 16, Positive unconditional cache size: 6539, Negative cache size: 176, Negative conditional cache size: 24, Negative unconditional cache size: 152, Eliminated conditions: 179 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 567.8ms, 188 PlacesBefore, 174 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 412 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 359, positive: 357, positive conditional: 357, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, positive: 357, positive conditional: 165, positive unconditional: 192, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, positive: 357, positive conditional: 165, positive unconditional: 192, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 361, positive: 350, positive conditional: 159, positive unconditional: 191, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6742, Positive cache size: 6562, Positive conditional cache size: 22, Positive unconditional cache size: 6540, Negative cache size: 180, Negative conditional cache size: 28, Negative unconditional cache size: 152, Eliminated conditions: 100 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.9ms, 179 PlacesBefore, 179 PlacesAfterwards, 145 TransitionsBefore, 145 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6743, Positive cache size: 6562, Positive conditional cache size: 22, Positive unconditional cache size: 6540, Negative cache size: 181, Negative conditional cache size: 29, Negative unconditional cache size: 152, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.9ms, 188 PlacesBefore, 188 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 1114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 35 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6743, Positive cache size: 6562, Positive conditional cache size: 22, Positive unconditional cache size: 6540, Negative cache size: 181, Negative conditional cache size: 29, Negative unconditional cache size: 152, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.9ms, 191 PlacesBefore, 188 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 988 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6743, Positive cache size: 6562, Positive conditional cache size: 22, Positive unconditional cache size: 6540, Negative cache size: 181, Negative conditional cache size: 29, Negative unconditional cache size: 152, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.9ms, 187 PlacesBefore, 183 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 17 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6743, Positive cache size: 6562, Positive conditional cache size: 22, Positive unconditional cache size: 6540, Negative cache size: 181, Negative conditional cache size: 29, Negative unconditional cache size: 152, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.8ms, 179 PlacesBefore, 158 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, positive: 16, positive conditional: 14, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 14, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 12, positive conditional: 10, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6748, Positive cache size: 6566, Positive conditional cache size: 26, Positive unconditional cache size: 6540, Negative cache size: 182, Negative conditional cache size: 29, Negative unconditional cache size: 153, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 122 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6748, Positive cache size: 6566, Positive conditional cache size: 26, Positive unconditional cache size: 6540, Negative cache size: 182, Negative conditional cache size: 29, Negative unconditional cache size: 153, Eliminated conditions: 0 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 161369.3ms, OverallIterations: 40, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 115896.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6873.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1225 SDtfs, 2721 SDslu, 2060 SDs, 0 SdLazy, 11269 SolverSat, 858 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5387.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2076.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7856occurred in iteration=25, InterpolantAutomatonStates: 353, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.8ms SsaConstructionTime, 306.9ms SatisfiabilityAnalysisTime, 1785.4ms InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 5110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...