./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:43:01,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:43:01,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:43:01,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:43:01,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:43:01,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:43:01,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:43:01,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:43:01,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:43:01,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:43:01,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:43:01,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:43:01,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:43:01,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:43:01,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:43:01,647 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:43:01,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:43:01,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:43:01,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:43:01,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:43:01,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:43:01,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:43:01,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:43:01,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:43:01,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:43:01,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:43:01,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:43:01,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:43:01,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:43:01,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:43:01,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:43:01,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:43:01,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:43:01,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:43:01,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:43:01,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:43:01,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:43:01,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:43:01,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:43:01,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:43:01,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:43:01,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:43:01,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:43:01,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:43:01,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:43:01,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:43:01,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:43:01,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:43:01,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:43:01,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:43:01,710 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:43:01,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:43:01,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:43:01,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:43:01,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:43:01,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:43:01,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:43:01,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:43:01,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:43:01,712 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:43:01,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:43:01,713 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:43:01,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:43:01,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:43:01,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:43:01,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:43:01,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:43:01,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:43:01,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:43:01,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:43:01,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:43:01,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:43:01,715 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:43:01,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:43:01,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:43:01,716 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:43:01,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2021-12-16 02:43:01,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:43:01,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:43:01,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:43:01,959 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:43:01,960 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:43:01,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-16 02:43:02,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0192b16/de34e586c5f2464e9b1c9e1897600aa1/FLAG94e0a087d [2021-12-16 02:43:02,440 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:43:02,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-12-16 02:43:02,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0192b16/de34e586c5f2464e9b1c9e1897600aa1/FLAG94e0a087d [2021-12-16 02:43:02,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0192b16/de34e586c5f2464e9b1c9e1897600aa1 [2021-12-16 02:43:02,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:43:02,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:43:02,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:43:02,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:43:02,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:43:02,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:43:02" (1/1) ... [2021-12-16 02:43:02,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332b18b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:02, skipping insertion in model container [2021-12-16 02:43:02,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:43:02" (1/1) ... [2021-12-16 02:43:02,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:43:02,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:43:03,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-16 02:43:03,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-16 02:43:03,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:43:03,110 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:43:03,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-12-16 02:43:03,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-12-16 02:43:03,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:43:03,177 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:43:03,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03 WrapperNode [2021-12-16 02:43:03,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:43:03,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:43:03,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:43:03,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:43:03,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,248 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2021-12-16 02:43:03,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:43:03,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:43:03,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:43:03,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:43:03,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:43:03,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:43:03,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:43:03,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:43:03,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (1/1) ... [2021-12-16 02:43:03,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:43:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:43:03,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 02:43:03,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 02:43:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-12-16 02:43:03,360 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-12-16 02:43:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-12-16 02:43:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-12-16 02:43:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 02:43:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:43:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-12-16 02:43:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:43:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:43:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:43:03,365 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:43:03,507 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:43:03,508 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:43:03,874 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:43:03,971 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:43:03,972 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 02:43:03,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:03 BoogieIcfgContainer [2021-12-16 02:43:03,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:43:03,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:43:03,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:43:03,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:43:03,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:43:02" (1/3) ... [2021-12-16 02:43:03,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@993acf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:43:03, skipping insertion in model container [2021-12-16 02:43:03,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:43:03" (2/3) ... [2021-12-16 02:43:03,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@993acf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:43:03, skipping insertion in model container [2021-12-16 02:43:03,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:03" (3/3) ... [2021-12-16 02:43:03,979 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-12-16 02:43:03,983 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:43:03,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:43:03,984 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-16 02:43:03,984 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:43:04,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,028 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,028 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,029 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,029 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,029 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,029 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,030 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,031 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,031 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,031 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,031 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,031 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,032 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,032 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,032 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,032 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,032 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,033 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,033 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,033 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,033 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,033 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,034 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,035 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,036 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,037 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,038 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,039 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,040 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,041 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,042 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,043 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,044 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,045 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,046 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,047 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,048 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,049 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,049 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,049 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,049 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,049 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,050 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,051 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,051 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,051 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,051 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,054 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,055 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,056 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,057 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,058 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,059 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,060 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,086 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,086 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,086 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,087 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,088 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,089 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,090 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,091 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,092 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:43:04,094 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-16 02:43:04,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:43:04,151 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 02:43:04,151 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-16 02:43:04,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2021-12-16 02:43:04,203 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2021-12-16 02:43:04,204 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-16 02:43:04,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 18/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 134. Up to 4 conditions per place. [2021-12-16 02:43:04,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2021-12-16 02:43:04,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2021-12-16 02:43:04,236 INFO L129 PetriNetUnfolder]: 9/124 cut-off events. [2021-12-16 02:43:04,239 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-16 02:43:04,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:04,240 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:04,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2021-12-16 02:43:04,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:04,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201648955] [2021-12-16 02:43:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:04,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:04,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:04,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201648955] [2021-12-16 02:43:04,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201648955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:04,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:04,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 02:43:04,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247882546] [2021-12-16 02:43:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:04,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:04,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:04,447 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-12-16 02:43:04,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-12-16 02:43:04,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:04,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-12-16 02:43:04,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:04,751 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2021-12-16 02:43:04,752 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2021-12-16 02:43:04,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1791 events. 629/1791 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12222 event pairs, 272 based on Foata normal form. 180/1804 useless extension candidates. Maximal degree in co-relation 1910. Up to 618 conditions per place. [2021-12-16 02:43:04,785 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2021-12-16 02:43:04,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2021-12-16 02:43:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-16 02:43:04,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-16 02:43:04,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-16 02:43:04,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-16 02:43:04,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:04,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-16 02:43:04,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-12-16 02:43:04,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:04,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:04,817 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2021-12-16 02:43:04,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2021-12-16 02:43:04,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-16 02:43:04,826 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2021-12-16 02:43:04,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=159, PETRI_TRANSITIONS=163} [2021-12-16 02:43:04,834 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2021-12-16 02:43:04,834 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2021-12-16 02:43:04,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-12-16 02:43:04,835 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:04,835 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:04,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:43:04,836 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2021-12-16 02:43:04,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622863035] [2021-12-16 02:43:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:04,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:04,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:04,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622863035] [2021-12-16 02:43:04,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622863035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:04,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:04,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 02:43:04,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741226451] [2021-12-16 02:43:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:04,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:04,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:04,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-16 02:43:04,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-12-16 02:43:04,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:04,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-16 02:43:04,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:05,135 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2021-12-16 02:43:05,136 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-12-16 02:43:05,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 1255 events. 402/1255 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7965 event pairs, 79 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1163. Up to 395 conditions per place. [2021-12-16 02:43:05,145 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-12-16 02:43:05,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2021-12-16 02:43:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-16 02:43:05,147 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-16 02:43:05,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-16 02:43:05,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-16 02:43:05,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:05,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-16 02:43:05,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-12-16 02:43:05,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:05,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:05,151 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2021-12-16 02:43:05,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2021-12-16 02:43:05,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-16 02:43:05,157 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2021-12-16 02:43:05,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2021-12-16 02:43:05,158 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2021-12-16 02:43:05,159 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2021-12-16 02:43:05,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-12-16 02:43:05,160 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:05,160 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:05,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:43:05,160 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2021-12-16 02:43:05,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:05,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278194664] [2021-12-16 02:43:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:05,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:05,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:05,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278194664] [2021-12-16 02:43:05,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278194664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:05,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:05,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:43:05,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545798133] [2021-12-16 02:43:05,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:05,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:43:05,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:05,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:43:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:43:05,258 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:05,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-12-16 02:43:05,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:05,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:05,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:06,059 INFO L129 PetriNetUnfolder]: 2951/6671 cut-off events. [2021-12-16 02:43:06,059 INFO L130 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2021-12-16 02:43:06,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10975 conditions, 6671 events. 2951/6671 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 56312 event pairs, 405 based on Foata normal form. 0/6223 useless extension candidates. Maximal degree in co-relation 7824. Up to 1682 conditions per place. [2021-12-16 02:43:06,105 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 84 selfloop transitions, 11 changer transitions 7/227 dead transitions. [2021-12-16 02:43:06,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 695 flow [2021-12-16 02:43:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:43:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:43:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1070 transitions. [2021-12-16 02:43:06,108 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352849336455894 [2021-12-16 02:43:06,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1070 transitions. [2021-12-16 02:43:06,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1070 transitions. [2021-12-16 02:43:06,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:06,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1070 transitions. [2021-12-16 02:43:06,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.85714285714286) internal successors, (1070), 7 states have internal predecessors, (1070), 0 states have call successors, (0), 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-12-16 02:43:06,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 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-12-16 02:43:06,113 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 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-12-16 02:43:06,113 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 7 states and 1070 transitions. [2021-12-16 02:43:06,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 695 flow [2021-12-16 02:43:06,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:43:06,121 INFO L242 Difference]: Finished difference. Result has 168 places, 172 transitions, 408 flow [2021-12-16 02:43:06,121 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=168, PETRI_TRANSITIONS=172} [2021-12-16 02:43:06,123 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2021-12-16 02:43:06,123 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 172 transitions, 408 flow [2021-12-16 02:43:06,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-12-16 02:43:06,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:06,124 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:06,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:43:06,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 54936445, now seen corresponding path program 1 times [2021-12-16 02:43:06,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:06,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099154437] [2021-12-16 02:43:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:06,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:06,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:06,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099154437] [2021-12-16 02:43:06,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099154437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:06,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:06,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:06,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796097561] [2021-12-16 02:43:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:06,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:43:06,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:43:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:43:06,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-16 02:43:06,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 172 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 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-12-16 02:43:06,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:06,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-16 02:43:06,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:06,751 INFO L129 PetriNetUnfolder]: 1220/3032 cut-off events. [2021-12-16 02:43:06,751 INFO L130 PetriNetUnfolder]: For 386/397 co-relation queries the response was YES. [2021-12-16 02:43:06,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 3032 events. 1220/3032 cut-off events. For 386/397 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 24014 event pairs, 241 based on Foata normal form. 128/3023 useless extension candidates. Maximal degree in co-relation 5210. Up to 1544 conditions per place. [2021-12-16 02:43:06,774 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 95 selfloop transitions, 31 changer transitions 0/253 dead transitions. [2021-12-16 02:43:06,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 253 transitions, 868 flow [2021-12-16 02:43:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 02:43:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-16 02:43:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2021-12-16 02:43:06,777 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2021-12-16 02:43:06,777 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2021-12-16 02:43:06,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2021-12-16 02:43:06,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:06,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2021-12-16 02:43:06,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.75) internal successors, (1198), 8 states have internal predecessors, (1198), 0 states have call successors, (0), 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-12-16 02:43:06,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 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-12-16 02:43:06,782 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 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-12-16 02:43:06,783 INFO L186 Difference]: Start difference. First operand has 168 places, 172 transitions, 408 flow. Second operand 8 states and 1198 transitions. [2021-12-16 02:43:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 253 transitions, 868 flow [2021-12-16 02:43:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 253 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:06,789 INFO L242 Difference]: Finished difference. Result has 181 places, 205 transitions, 655 flow [2021-12-16 02:43:06,789 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=655, PETRI_PLACES=181, PETRI_TRANSITIONS=205} [2021-12-16 02:43:06,790 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 21 predicate places. [2021-12-16 02:43:06,790 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 205 transitions, 655 flow [2021-12-16 02:43:06,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 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-12-16 02:43:06,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:06,791 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:06,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:43:06,791 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1048679875, now seen corresponding path program 2 times [2021-12-16 02:43:06,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:06,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866655183] [2021-12-16 02:43:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:06,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:06,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:06,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866655183] [2021-12-16 02:43:06,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866655183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:06,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:06,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:43:06,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066792913] [2021-12-16 02:43:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:06,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:43:06,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:06,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:43:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:43:06,911 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2021-12-16 02:43:06,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 205 transitions, 655 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 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-12-16 02:43:06,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:06,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2021-12-16 02:43:06,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:07,718 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 101#L786-4true, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:07,719 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2021-12-16 02:43:07,719 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-16 02:43:07,719 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-16 02:43:07,719 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2021-12-16 02:43:07,760 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [111#L739-3true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 101#L786-4true, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:07,760 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2021-12-16 02:43:07,760 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-16 02:43:07,760 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-16 02:43:07,760 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-12-16 02:43:07,824 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:07,824 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-16 02:43:07,824 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:07,824 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:07,824 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:07,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [111#L739-3true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:07,858 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,858 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,858 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,858 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,865 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 119#L738true, 101#L786-4true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true]) [2021-12-16 02:43:07,866 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,866 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-16 02:43:07,866 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:07,866 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-12-16 02:43:07,975 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 101#L786-4true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true]) [2021-12-16 02:43:07,976 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2021-12-16 02:43:07,976 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-16 02:43:07,976 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:07,976 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2021-12-16 02:43:08,033 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:08,034 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,034 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,034 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,034 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,040 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 119#L738true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 186#(= ~readerprogress1~0 0), 204#true]) [2021-12-16 02:43:08,040 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,040 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2021-12-16 02:43:08,040 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:08,040 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-16 02:43:08,073 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 22#L739true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 186#(= ~readerprogress1~0 0), 204#true]) [2021-12-16 02:43:08,074 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-16 02:43:08,074 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:08,074 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-16 02:43:08,074 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-12-16 02:43:08,107 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 55#L758-3true]) [2021-12-16 02:43:08,107 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is not cut-off event [2021-12-16 02:43:08,108 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-16 02:43:08,108 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-16 02:43:08,108 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2021-12-16 02:43:08,196 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 87#L788-2true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true]) [2021-12-16 02:43:08,196 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-12-16 02:43:08,196 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:08,196 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:08,196 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:08,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 71#L789-1true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true]) [2021-12-16 02:43:08,319 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is not cut-off event [2021-12-16 02:43:08,319 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-16 02:43:08,319 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-16 02:43:08,319 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-12-16 02:43:08,449 INFO L129 PetriNetUnfolder]: 5661/11999 cut-off events. [2021-12-16 02:43:08,449 INFO L130 PetriNetUnfolder]: For 11590/11778 co-relation queries the response was YES. [2021-12-16 02:43:08,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28466 conditions, 11999 events. 5661/11999 cut-off events. For 11590/11778 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 111859 event pairs, 1142 based on Foata normal form. 142/11468 useless extension candidates. Maximal degree in co-relation 25739. Up to 3359 conditions per place. [2021-12-16 02:43:08,551 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 175 selfloop transitions, 18 changer transitions 10/335 dead transitions. [2021-12-16 02:43:08,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 335 transitions, 1649 flow [2021-12-16 02:43:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:43:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:43:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2021-12-16 02:43:08,554 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2021-12-16 02:43:08,554 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2021-12-16 02:43:08,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2021-12-16 02:43:08,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:08,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2021-12-16 02:43:08,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.1) internal successors, (1381), 10 states have internal predecessors, (1381), 0 states have call successors, (0), 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-12-16 02:43:08,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:08,560 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:08,560 INFO L186 Difference]: Start difference. First operand has 181 places, 205 transitions, 655 flow. Second operand 10 states and 1381 transitions. [2021-12-16 02:43:08,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 335 transitions, 1649 flow [2021-12-16 02:43:08,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 335 transitions, 1649 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:08,608 INFO L242 Difference]: Finished difference. Result has 195 places, 221 transitions, 771 flow [2021-12-16 02:43:08,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=771, PETRI_PLACES=195, PETRI_TRANSITIONS=221} [2021-12-16 02:43:08,609 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 35 predicate places. [2021-12-16 02:43:08,609 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 221 transitions, 771 flow [2021-12-16 02:43:08,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 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-12-16 02:43:08,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:08,609 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:08,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:43:08,610 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 181404697, now seen corresponding path program 1 times [2021-12-16 02:43:08,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:08,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184677693] [2021-12-16 02:43:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:08,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:08,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184677693] [2021-12-16 02:43:08,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184677693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:08,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:08,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 02:43:08,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328778599] [2021-12-16 02:43:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:08,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 02:43:08,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 02:43:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 02:43:08,725 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-12-16 02:43:08,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 221 transitions, 771 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 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-12-16 02:43:08,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:08,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-12-16 02:43:08,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:09,475 INFO L129 PetriNetUnfolder]: 2049/5079 cut-off events. [2021-12-16 02:43:09,476 INFO L130 PetriNetUnfolder]: For 5457/5521 co-relation queries the response was YES. [2021-12-16 02:43:09,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 5079 events. 2049/5079 cut-off events. For 5457/5521 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 45552 event pairs, 226 based on Foata normal form. 97/4971 useless extension candidates. Maximal degree in co-relation 12429. Up to 1713 conditions per place. [2021-12-16 02:43:09,521 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 120 selfloop transitions, 37 changer transitions 0/298 dead transitions. [2021-12-16 02:43:09,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 298 transitions, 1417 flow [2021-12-16 02:43:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:43:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:43:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1468 transitions. [2021-12-16 02:43:09,525 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8021857923497268 [2021-12-16 02:43:09,525 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1468 transitions. [2021-12-16 02:43:09,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1468 transitions. [2021-12-16 02:43:09,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:09,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1468 transitions. [2021-12-16 02:43:09,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.8) internal successors, (1468), 10 states have internal predecessors, (1468), 0 states have call successors, (0), 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-12-16 02:43:09,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:09,531 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:09,531 INFO L186 Difference]: Start difference. First operand has 195 places, 221 transitions, 771 flow. Second operand 10 states and 1468 transitions. [2021-12-16 02:43:09,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 298 transitions, 1417 flow [2021-12-16 02:43:09,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 298 transitions, 1417 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:43:09,547 INFO L242 Difference]: Finished difference. Result has 209 places, 237 transitions, 1010 flow [2021-12-16 02:43:09,547 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1010, PETRI_PLACES=209, PETRI_TRANSITIONS=237} [2021-12-16 02:43:09,548 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2021-12-16 02:43:09,548 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 237 transitions, 1010 flow [2021-12-16 02:43:09,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 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-12-16 02:43:09,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:09,549 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:09,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:43:09,549 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash 928253015, now seen corresponding path program 1 times [2021-12-16 02:43:09,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:09,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112913216] [2021-12-16 02:43:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:09,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:09,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112913216] [2021-12-16 02:43:09,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112913216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:09,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:09,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 02:43:09,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250727018] [2021-12-16 02:43:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:09,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:09,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:09,609 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-12-16 02:43:09,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 237 transitions, 1010 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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-12-16 02:43:09,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:09,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-12-16 02:43:09,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:09,968 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][212], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:09,968 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:43:09,968 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:09,968 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:09,968 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:09,969 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][213], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:09,969 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:43:09,969 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:09,969 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:09,969 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,064 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][212], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:10,065 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][213], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:10,065 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:10,065 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,066 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:10,066 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,066 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:10,131 INFO L129 PetriNetUnfolder]: 1445/4568 cut-off events. [2021-12-16 02:43:10,131 INFO L130 PetriNetUnfolder]: For 5562/5817 co-relation queries the response was YES. [2021-12-16 02:43:10,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10936 conditions, 4568 events. 1445/4568 cut-off events. For 5562/5817 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 43354 event pairs, 311 based on Foata normal form. 155/4401 useless extension candidates. Maximal degree in co-relation 10196. Up to 1193 conditions per place. [2021-12-16 02:43:10,176 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 73 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2021-12-16 02:43:10,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 258 transitions, 1286 flow [2021-12-16 02:43:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-12-16 02:43:10,178 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-12-16 02:43:10,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-12-16 02:43:10,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-12-16 02:43:10,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:10,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-12-16 02:43:10,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-12-16 02:43:10,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:10,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:10,180 INFO L186 Difference]: Start difference. First operand has 209 places, 237 transitions, 1010 flow. Second operand 3 states and 500 transitions. [2021-12-16 02:43:10,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 258 transitions, 1286 flow [2021-12-16 02:43:10,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 258 transitions, 1263 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:10,197 INFO L242 Difference]: Finished difference. Result has 208 places, 237 transitions, 994 flow [2021-12-16 02:43:10,198 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=994, PETRI_PLACES=208, PETRI_TRANSITIONS=237} [2021-12-16 02:43:10,198 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2021-12-16 02:43:10,198 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 237 transitions, 994 flow [2021-12-16 02:43:10,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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-12-16 02:43:10,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:10,199 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:10,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:43:10,199 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -810213288, now seen corresponding path program 1 times [2021-12-16 02:43:10,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979846343] [2021-12-16 02:43:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:10,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:10,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979846343] [2021-12-16 02:43:10,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979846343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:10,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:10,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:43:10,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270052361] [2021-12-16 02:43:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:10,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:43:10,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:43:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:43:10,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:10,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 237 transitions, 994 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 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-12-16 02:43:10,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:10,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:10,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:11,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, 166#L771-3true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,138 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,138 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,138 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,139 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,139 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,139 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,139 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,139 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,139 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-12-16 02:43:11,195 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 233#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 267#(= 2 ~readerprogress1~0), 265#true, 101#L786-4true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 68#L725-3true, 272#(= 2 ~readerprogress2~0), 204#true, 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true]) [2021-12-16 02:43:11,195 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-12-16 02:43:11,195 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:43:11,195 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,195 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,241 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 267#(= 2 ~readerprogress1~0), 119#L738true, 265#true, 101#L786-4true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,241 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,241 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,241 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,241 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:43:11,272 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 270#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 52#L744-3true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,272 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-12-16 02:43:11,272 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-16 02:43:11,272 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-16 02:43:11,272 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-16 02:43:11,275 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 166#L771-3true, 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,275 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,275 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,275 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,275 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,276 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,276 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,276 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,276 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-12-16 02:43:11,322 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 270#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,323 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,323 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:43:11,323 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:43:11,323 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-12-16 02:43:11,328 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 168#L772-6true, Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,328 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-12-16 02:43:11,328 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:11,328 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:11,329 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-12-16 02:43:11,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 101#L786-4true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,330 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,331 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,331 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,331 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,337 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, 233#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 84#L787-1true, Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 267#(= 2 ~readerprogress1~0), 265#true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 68#L725-3true, 272#(= 2 ~readerprogress2~0), 204#true, 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true]) [2021-12-16 02:43:11,337 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,337 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,337 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,337 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,464 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,464 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,465 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,465 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,465 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 270#true, 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 52#L744-3true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,465 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,465 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,466 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,466 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,469 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 166#L771-3true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,469 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,469 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,470 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,470 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,470 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,471 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,471 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,471 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-12-16 02:43:11,485 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 84#L787-1true, Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 267#(= 2 ~readerprogress1~0), 119#L738true, 265#true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,485 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,485 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,485 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,485 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,523 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 270#true, 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,523 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-12-16 02:43:11,523 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:43:11,524 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:43:11,524 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:43:11,530 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 270#true, 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,531 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-16 02:43:11,531 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,531 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:43:11,531 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:43:11,536 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, 84#L787-1true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,536 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,536 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,536 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,536 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,547 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,547 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,547 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,547 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,553 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][226], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,553 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,553 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,553 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,553 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,553 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][226], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 166#L771-3true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,554 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][227], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,554 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,554 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,555 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,555 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][227], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 51#L772-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,555 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,555 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,555 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-12-16 02:43:11,555 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:11,578 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 244#true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, 267#(= 2 ~readerprogress1~0), qrcu_updaterThread1of1ForFork0InUse, Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,578 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,578 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,578 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,578 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-12-16 02:43:11,583 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 168#L772-6true, Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,583 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is not cut-off event [2021-12-16 02:43:11,583 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-16 02:43:11,583 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-16 02:43:11,583 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-12-16 02:43:11,586 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 204#true, 270#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,586 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-12-16 02:43:11,587 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-16 02:43:11,587 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-16 02:43:11,587 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-12-16 02:43:11,587 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [111#L739-3true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, 84#L787-1true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,587 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,588 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,588 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,588 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,588 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-12-16 02:43:11,661 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 91#L777true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,661 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,661 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,661 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,661 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,693 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) .cse0 (= v_~ctr2~0_89 v_~ctr2~0_88)) (and (not .cse0) (= v_~ctr1~0_87 v_~ctr1~0_86) (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 168#L772-6true, Black: 206#(= ~ctr1~0 1), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:11,693 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-12-16 02:43:11,693 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:11,693 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:11,693 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-12-16 02:43:11,735 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,736 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,736 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,736 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,736 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,736 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,736 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 270#true, 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,737 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 270#true, 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), 195#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,737 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,737 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-12-16 02:43:11,822 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 91#L777true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 211#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr1~0 1)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, 120#L788-1true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 59#L758true, qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 231#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:11,822 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,822 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,822 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,822 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,822 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-12-16 02:43:11,991 INFO L129 PetriNetUnfolder]: 6360/14335 cut-off events. [2021-12-16 02:43:11,991 INFO L130 PetriNetUnfolder]: For 18185/19108 co-relation queries the response was YES. [2021-12-16 02:43:12,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36684 conditions, 14335 events. 6360/14335 cut-off events. For 18185/19108 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 144300 event pairs, 1185 based on Foata normal form. 265/13499 useless extension candidates. Maximal degree in co-relation 34764. Up to 4035 conditions per place. [2021-12-16 02:43:12,163 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 136 selfloop transitions, 6 changer transitions 15/316 dead transitions. [2021-12-16 02:43:12,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 316 transitions, 1717 flow [2021-12-16 02:43:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 02:43:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-16 02:43:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 774 transitions. [2021-12-16 02:43:12,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8459016393442623 [2021-12-16 02:43:12,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 774 transitions. [2021-12-16 02:43:12,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 774 transitions. [2021-12-16 02:43:12,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:12,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 774 transitions. [2021-12-16 02:43:12,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 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-12-16 02:43:12,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 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-12-16 02:43:12,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 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-12-16 02:43:12,170 INFO L186 Difference]: Start difference. First operand has 208 places, 237 transitions, 994 flow. Second operand 5 states and 774 transitions. [2021-12-16 02:43:12,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 316 transitions, 1717 flow [2021-12-16 02:43:12,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 316 transitions, 1716 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-16 02:43:12,226 INFO L242 Difference]: Finished difference. Result has 214 places, 242 transitions, 1056 flow [2021-12-16 02:43:12,226 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1056, PETRI_PLACES=214, PETRI_TRANSITIONS=242} [2021-12-16 02:43:12,228 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 54 predicate places. [2021-12-16 02:43:12,229 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 242 transitions, 1056 flow [2021-12-16 02:43:12,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 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-12-16 02:43:12,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:12,229 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:12,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:43:12,230 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1045246048, now seen corresponding path program 1 times [2021-12-16 02:43:12,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:12,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447189313] [2021-12-16 02:43:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:12,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:12,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447189313] [2021-12-16 02:43:12,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447189313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:12,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:12,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 02:43:12,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986795002] [2021-12-16 02:43:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:12,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:12,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:12,266 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-16 02:43:12,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 242 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-12-16 02:43:12,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:12,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-16 02:43:12,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:13,456 INFO L129 PetriNetUnfolder]: 3145/9814 cut-off events. [2021-12-16 02:43:13,456 INFO L130 PetriNetUnfolder]: For 10730/11013 co-relation queries the response was YES. [2021-12-16 02:43:13,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21687 conditions, 9814 events. 3145/9814 cut-off events. For 10730/11013 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 105049 event pairs, 746 based on Foata normal form. 82/9065 useless extension candidates. Maximal degree in co-relation 21299. Up to 3120 conditions per place. [2021-12-16 02:43:13,518 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 60 selfloop transitions, 1 changer transitions 48/261 dead transitions. [2021-12-16 02:43:13,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 261 transitions, 1308 flow [2021-12-16 02:43:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-12-16 02:43:13,519 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-12-16 02:43:13,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-12-16 02:43:13,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-12-16 02:43:13,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:13,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-12-16 02:43:13,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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-12-16 02:43:13,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:13,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:13,522 INFO L186 Difference]: Start difference. First operand has 214 places, 242 transitions, 1056 flow. Second operand 3 states and 494 transitions. [2021-12-16 02:43:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 261 transitions, 1308 flow [2021-12-16 02:43:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 261 transitions, 1297 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-16 02:43:13,557 INFO L242 Difference]: Finished difference. Result has 216 places, 199 transitions, 772 flow [2021-12-16 02:43:13,558 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2021-12-16 02:43:13,558 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 56 predicate places. [2021-12-16 02:43:13,559 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 772 flow [2021-12-16 02:43:13,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-12-16 02:43:13,559 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:13,559 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:13,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:43:13,560 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2021-12-16 02:43:13,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201963088] [2021-12-16 02:43:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:13,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:13,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201963088] [2021-12-16 02:43:13,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201963088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:13,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:13,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:43:13,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769941933] [2021-12-16 02:43:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:13,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:43:13,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:43:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:43:13,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2021-12-16 02:43:13,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 772 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 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-12-16 02:43:13,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:13,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2021-12-16 02:43:13,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:14,118 INFO L129 PetriNetUnfolder]: 1388/4475 cut-off events. [2021-12-16 02:43:14,118 INFO L130 PetriNetUnfolder]: For 4221/4273 co-relation queries the response was YES. [2021-12-16 02:43:14,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 4475 events. 1388/4475 cut-off events. For 4221/4273 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 44129 event pairs, 403 based on Foata normal form. 16/4254 useless extension candidates. Maximal degree in co-relation 9978. Up to 1462 conditions per place. [2021-12-16 02:43:14,149 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 71 selfloop transitions, 31 changer transitions 11/257 dead transitions. [2021-12-16 02:43:14,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 257 transitions, 1297 flow [2021-12-16 02:43:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 02:43:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 02:43:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-12-16 02:43:14,151 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87743950039032 [2021-12-16 02:43:14,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-12-16 02:43:14,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-12-16 02:43:14,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:14,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-12-16 02:43:14,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 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-12-16 02:43:14,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 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-12-16 02:43:14,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 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-12-16 02:43:14,155 INFO L186 Difference]: Start difference. First operand has 216 places, 199 transitions, 772 flow. Second operand 7 states and 1124 transitions. [2021-12-16 02:43:14,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 257 transitions, 1297 flow [2021-12-16 02:43:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 257 transitions, 1248 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-16 02:43:14,172 INFO L242 Difference]: Finished difference. Result has 205 places, 214 transitions, 958 flow [2021-12-16 02:43:14,172 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=958, PETRI_PLACES=205, PETRI_TRANSITIONS=214} [2021-12-16 02:43:14,172 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2021-12-16 02:43:14,172 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 214 transitions, 958 flow [2021-12-16 02:43:14,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 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-12-16 02:43:14,173 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:14,173 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:14,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:43:14,173 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1402509722, now seen corresponding path program 1 times [2021-12-16 02:43:14,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:14,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146978980] [2021-12-16 02:43:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:14,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:14,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146978980] [2021-12-16 02:43:14,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146978980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:14,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:14,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 02:43:14,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286434191] [2021-12-16 02:43:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:14,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 02:43:14,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 02:43:14,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 02:43:14,202 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-12-16 02:43:14,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 214 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-12-16 02:43:14,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:14,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-12-16 02:43:14,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:14,412 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [111#L739-3true, 189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 288#true, Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 79#L771-1true, Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 304#(= ~idx~0 0), Black: 191#(= ~readerprogress2~0 0), 101#L786-4true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 276#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|)) (= 2 ~readerprogress2~0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, Black: 285#(= ~idx~0 1), Black: 291#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 292#(<= 1 ~ctr2~0), Black: 290#(= ~ctr2~0 0), qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:14,412 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-12-16 02:43:14,412 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-12-16 02:43:14,413 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 02:43:14,413 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-12-16 02:43:14,456 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 288#true, Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 79#L771-1true, Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 304#(= ~idx~0 0), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 276#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|)) (= 2 ~readerprogress2~0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, Black: 285#(= ~idx~0 1), Black: 291#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 292#(<= 1 ~ctr2~0), Black: 290#(= ~ctr2~0 0), qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0), 55#L758-3true]) [2021-12-16 02:43:14,456 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-12-16 02:43:14,456 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-12-16 02:43:14,456 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-16 02:43:14,457 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-12-16 02:43:14,484 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 288#true, Black: 244#true, Black: 254#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 79#L771-1true, Black: 256#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0)), 304#(= ~idx~0 0), Black: 191#(= ~readerprogress2~0 0), 87#L788-2true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 208#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 213#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), Black: 276#(and (= 2 (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|)) (= 2 ~readerprogress2~0)), Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 209#(and (= ~ctr2~0 0) (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|)), 272#(= 2 ~readerprogress2~0), 204#true, Black: 285#(= ~idx~0 1), Black: 291#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 292#(<= 1 ~ctr2~0), Black: 290#(= ~ctr2~0 0), qrcu_updaterThread1of1ForFork0InUse, 267#(= 2 ~readerprogress1~0), Black: 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 224#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (= ~readerprogress1~0 0)), Black: 229#(and (= 1 (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|)) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|)) (= ~readerprogress1~0 0)), Black: 223#(= ~readerprogress1~0 0), Black: 178#true, Black: 186#(= ~readerprogress1~0 0)]) [2021-12-16 02:43:14,484 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2021-12-16 02:43:14,484 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-12-16 02:43:14,484 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:14,484 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-12-16 02:43:14,499 INFO L129 PetriNetUnfolder]: 879/3238 cut-off events. [2021-12-16 02:43:14,500 INFO L130 PetriNetUnfolder]: For 5387/5460 co-relation queries the response was YES. [2021-12-16 02:43:14,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7914 conditions, 3238 events. 879/3238 cut-off events. For 5387/5460 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 29464 event pairs, 209 based on Foata normal form. 14/3084 useless extension candidates. Maximal degree in co-relation 7588. Up to 823 conditions per place. [2021-12-16 02:43:14,519 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 57 selfloop transitions, 2 changer transitions 5/210 dead transitions. [2021-12-16 02:43:14,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 210 transitions, 1082 flow [2021-12-16 02:43:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 02:43:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-16 02:43:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-12-16 02:43:14,520 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-12-16 02:43:14,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-12-16 02:43:14,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-12-16 02:43:14,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:14,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-12-16 02:43:14,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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-12-16 02:43:14,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:14,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-12-16 02:43:14,523 INFO L186 Difference]: Start difference. First operand has 205 places, 214 transitions, 958 flow. Second operand 3 states and 488 transitions. [2021-12-16 02:43:14,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 210 transitions, 1082 flow [2021-12-16 02:43:14,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 210 transitions, 1065 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-16 02:43:14,537 INFO L242 Difference]: Finished difference. Result has 196 places, 190 transitions, 804 flow [2021-12-16 02:43:14,538 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=196, PETRI_TRANSITIONS=190} [2021-12-16 02:43:14,538 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 36 predicate places. [2021-12-16 02:43:14,538 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 190 transitions, 804 flow [2021-12-16 02:43:14,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-12-16 02:43:14,539 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:14,539 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:14,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:43:14,539 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1405396640, now seen corresponding path program 1 times [2021-12-16 02:43:14,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:14,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160186511] [2021-12-16 02:43:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:14,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:14,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:14,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160186511] [2021-12-16 02:43:14,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160186511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:14,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:14,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:43:14,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349041527] [2021-12-16 02:43:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:14,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:43:14,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:43:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:43:14,666 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:14,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 190 transitions, 804 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:14,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:14,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:14,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:15,395 INFO L129 PetriNetUnfolder]: 1962/4860 cut-off events. [2021-12-16 02:43:15,395 INFO L130 PetriNetUnfolder]: For 9399/9482 co-relation queries the response was YES. [2021-12-16 02:43:15,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14506 conditions, 4860 events. 1962/4860 cut-off events. For 9399/9482 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 41843 event pairs, 464 based on Foata normal form. 66/4793 useless extension candidates. Maximal degree in co-relation 14221. Up to 2075 conditions per place. [2021-12-16 02:43:15,424 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 134 selfloop transitions, 46 changer transitions 7/297 dead transitions. [2021-12-16 02:43:15,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 297 transitions, 1866 flow [2021-12-16 02:43:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:43:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:43:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2021-12-16 02:43:15,427 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2021-12-16 02:43:15,427 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2021-12-16 02:43:15,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2021-12-16 02:43:15,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:15,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2021-12-16 02:43:15,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.72727272727272) internal successors, (1493), 11 states have internal predecessors, (1493), 0 states have call successors, (0), 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-12-16 02:43:15,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:15,432 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:15,432 INFO L186 Difference]: Start difference. First operand has 196 places, 190 transitions, 804 flow. Second operand 11 states and 1493 transitions. [2021-12-16 02:43:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 297 transitions, 1866 flow [2021-12-16 02:43:15,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 297 transitions, 1862 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 02:43:15,454 INFO L242 Difference]: Finished difference. Result has 208 places, 216 transitions, 1237 flow [2021-12-16 02:43:15,455 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1237, PETRI_PLACES=208, PETRI_TRANSITIONS=216} [2021-12-16 02:43:15,455 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2021-12-16 02:43:15,455 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 216 transitions, 1237 flow [2021-12-16 02:43:15,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:15,456 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:15,456 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:15,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:43:15,456 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:15,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1080344130, now seen corresponding path program 2 times [2021-12-16 02:43:15,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:15,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626667403] [2021-12-16 02:43:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:15,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:15,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:15,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626667403] [2021-12-16 02:43:15,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626667403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:15,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:15,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:43:15,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100043863] [2021-12-16 02:43:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:15,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:43:15,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:43:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:43:15,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:15,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 216 transitions, 1237 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:15,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:15,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:15,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:16,326 INFO L129 PetriNetUnfolder]: 2012/5097 cut-off events. [2021-12-16 02:43:16,326 INFO L130 PetriNetUnfolder]: For 14226/14343 co-relation queries the response was YES. [2021-12-16 02:43:16,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16612 conditions, 5097 events. 2012/5097 cut-off events. For 14226/14343 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 44820 event pairs, 522 based on Foata normal form. 95/5028 useless extension candidates. Maximal degree in co-relation 16311. Up to 1993 conditions per place. [2021-12-16 02:43:16,360 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 132 selfloop transitions, 65 changer transitions 31/338 dead transitions. [2021-12-16 02:43:16,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 338 transitions, 2609 flow [2021-12-16 02:43:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:43:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:43:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2021-12-16 02:43:16,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2021-12-16 02:43:16,367 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2021-12-16 02:43:16,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2021-12-16 02:43:16,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:16,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2021-12-16 02:43:16,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 134.84615384615384) internal successors, (1753), 13 states have internal predecessors, (1753), 0 states have call successors, (0), 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-12-16 02:43:16,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-12-16 02:43:16,383 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-12-16 02:43:16,383 INFO L186 Difference]: Start difference. First operand has 208 places, 216 transitions, 1237 flow. Second operand 13 states and 1753 transitions. [2021-12-16 02:43:16,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 338 transitions, 2609 flow [2021-12-16 02:43:16,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 338 transitions, 2546 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-12-16 02:43:16,414 INFO L242 Difference]: Finished difference. Result has 220 places, 232 transitions, 1605 flow [2021-12-16 02:43:16,414 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1605, PETRI_PLACES=220, PETRI_TRANSITIONS=232} [2021-12-16 02:43:16,415 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 60 predicate places. [2021-12-16 02:43:16,415 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 232 transitions, 1605 flow [2021-12-16 02:43:16,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:16,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:16,416 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:16,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 02:43:16,416 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2044964558, now seen corresponding path program 1 times [2021-12-16 02:43:16,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456532850] [2021-12-16 02:43:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:16,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:16,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:16,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456532850] [2021-12-16 02:43:16,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456532850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:16,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:16,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:43:16,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308381266] [2021-12-16 02:43:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:16,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:43:16,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:16,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:43:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:43:16,508 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:16,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 232 transitions, 1605 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:16,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:16,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:16,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:17,345 INFO L129 PetriNetUnfolder]: 1798/4730 cut-off events. [2021-12-16 02:43:17,345 INFO L130 PetriNetUnfolder]: For 19472/19609 co-relation queries the response was YES. [2021-12-16 02:43:17,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16193 conditions, 4730 events. 1798/4730 cut-off events. For 19472/19609 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 41989 event pairs, 359 based on Foata normal form. 130/4701 useless extension candidates. Maximal degree in co-relation 15903. Up to 1224 conditions per place. [2021-12-16 02:43:17,377 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 145 selfloop transitions, 65 changer transitions 12/332 dead transitions. [2021-12-16 02:43:17,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 332 transitions, 2683 flow [2021-12-16 02:43:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 02:43:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-16 02:43:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2248 transitions. [2021-12-16 02:43:17,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7225972356155577 [2021-12-16 02:43:17,381 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2248 transitions. [2021-12-16 02:43:17,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2248 transitions. [2021-12-16 02:43:17,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:17,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2248 transitions. [2021-12-16 02:43:17,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 132.23529411764707) internal successors, (2248), 17 states have internal predecessors, (2248), 0 states have call successors, (0), 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-12-16 02:43:17,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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-12-16 02:43:17,387 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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-12-16 02:43:17,387 INFO L186 Difference]: Start difference. First operand has 220 places, 232 transitions, 1605 flow. Second operand 17 states and 2248 transitions. [2021-12-16 02:43:17,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 332 transitions, 2683 flow [2021-12-16 02:43:17,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 332 transitions, 2612 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:17,425 INFO L242 Difference]: Finished difference. Result has 236 places, 244 transitions, 1827 flow [2021-12-16 02:43:17,426 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1827, PETRI_PLACES=236, PETRI_TRANSITIONS=244} [2021-12-16 02:43:17,426 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 76 predicate places. [2021-12-16 02:43:17,426 INFO L470 AbstractCegarLoop]: Abstraction has has 236 places, 244 transitions, 1827 flow [2021-12-16 02:43:17,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:17,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:17,427 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:17,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 02:43:17,427 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 560799056, now seen corresponding path program 3 times [2021-12-16 02:43:17,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:17,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142654444] [2021-12-16 02:43:17,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:17,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:17,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142654444] [2021-12-16 02:43:17,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142654444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:17,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:17,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:43:17,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239166501] [2021-12-16 02:43:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:17,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:43:17,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:43:17,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:43:17,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:17,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 244 transitions, 1827 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:17,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:17,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:17,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:18,222 INFO L129 PetriNetUnfolder]: 1719/4566 cut-off events. [2021-12-16 02:43:18,222 INFO L130 PetriNetUnfolder]: For 22972/23132 co-relation queries the response was YES. [2021-12-16 02:43:18,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16220 conditions, 4566 events. 1719/4566 cut-off events. For 22972/23132 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 40687 event pairs, 511 based on Foata normal form. 141/4557 useless extension candidates. Maximal degree in co-relation 15925. Up to 1655 conditions per place. [2021-12-16 02:43:18,261 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 158 selfloop transitions, 65 changer transitions 15/348 dead transitions. [2021-12-16 02:43:18,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 348 transitions, 3042 flow [2021-12-16 02:43:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2021-12-16 02:43:18,263 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2021-12-16 02:43:18,263 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2021-12-16 02:43:18,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2021-12-16 02:43:18,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:18,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2021-12-16 02:43:18,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.08333333333334) internal successors, (1633), 12 states have internal predecessors, (1633), 0 states have call successors, (0), 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-12-16 02:43:18,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:18,268 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:18,269 INFO L186 Difference]: Start difference. First operand has 236 places, 244 transitions, 1827 flow. Second operand 12 states and 1633 transitions. [2021-12-16 02:43:18,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 348 transitions, 3042 flow [2021-12-16 02:43:18,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 348 transitions, 3005 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:18,330 INFO L242 Difference]: Finished difference. Result has 247 places, 253 transitions, 2131 flow [2021-12-16 02:43:18,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2131, PETRI_PLACES=247, PETRI_TRANSITIONS=253} [2021-12-16 02:43:18,331 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 87 predicate places. [2021-12-16 02:43:18,331 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 253 transitions, 2131 flow [2021-12-16 02:43:18,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 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-12-16 02:43:18,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:18,332 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:18,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 02:43:18,332 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash -425659632, now seen corresponding path program 2 times [2021-12-16 02:43:18,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689920433] [2021-12-16 02:43:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:18,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:18,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:18,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689920433] [2021-12-16 02:43:18,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689920433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:18,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:18,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:43:18,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159967199] [2021-12-16 02:43:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:18,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:43:18,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:43:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:43:18,418 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:18,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 253 transitions, 2131 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:18,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:18,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:18,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:19,331 INFO L129 PetriNetUnfolder]: 1686/4530 cut-off events. [2021-12-16 02:43:19,331 INFO L130 PetriNetUnfolder]: For 28811/28979 co-relation queries the response was YES. [2021-12-16 02:43:19,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16971 conditions, 4530 events. 1686/4530 cut-off events. For 28811/28979 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 40405 event pairs, 344 based on Foata normal form. 142/4526 useless extension candidates. Maximal degree in co-relation 16670. Up to 1009 conditions per place. [2021-12-16 02:43:19,361 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 157 selfloop transitions, 68 changer transitions 31/366 dead transitions. [2021-12-16 02:43:19,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 366 transitions, 3457 flow [2021-12-16 02:43:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:43:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:43:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2021-12-16 02:43:19,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2021-12-16 02:43:19,365 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2021-12-16 02:43:19,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2021-12-16 02:43:19,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:19,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2021-12-16 02:43:19,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 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-12-16 02:43:19,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-12-16 02:43:19,373 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-12-16 02:43:19,373 INFO L186 Difference]: Start difference. First operand has 247 places, 253 transitions, 2131 flow. Second operand 16 states and 2144 transitions. [2021-12-16 02:43:19,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 366 transitions, 3457 flow [2021-12-16 02:43:19,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 366 transitions, 3362 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-12-16 02:43:19,441 INFO L242 Difference]: Finished difference. Result has 262 places, 257 transitions, 2303 flow [2021-12-16 02:43:19,441 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2303, PETRI_PLACES=262, PETRI_TRANSITIONS=257} [2021-12-16 02:43:19,441 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 102 predicate places. [2021-12-16 02:43:19,441 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 257 transitions, 2303 flow [2021-12-16 02:43:19,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:19,442 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:19,442 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:19,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 02:43:19,442 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1085664356, now seen corresponding path program 3 times [2021-12-16 02:43:19,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:19,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083968893] [2021-12-16 02:43:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:19,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:19,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:19,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083968893] [2021-12-16 02:43:19,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083968893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:19,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:19,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:43:19,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327820818] [2021-12-16 02:43:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:19,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:43:19,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:43:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:43:19,560 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:19,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 257 transitions, 2303 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:19,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:19,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:19,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:20,564 INFO L129 PetriNetUnfolder]: 1657/4491 cut-off events. [2021-12-16 02:43:20,564 INFO L130 PetriNetUnfolder]: For 35160/35333 co-relation queries the response was YES. [2021-12-16 02:43:20,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17171 conditions, 4491 events. 1657/4491 cut-off events. For 35160/35333 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40134 event pairs, 343 based on Foata normal form. 159/4505 useless extension candidates. Maximal degree in co-relation 16865. Up to 1014 conditions per place. [2021-12-16 02:43:20,605 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 143 selfloop transitions, 79 changer transitions 11/343 dead transitions. [2021-12-16 02:43:20,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 343 transitions, 3304 flow [2021-12-16 02:43:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 02:43:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-16 02:43:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2366 transitions. [2021-12-16 02:43:20,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7182756527018822 [2021-12-16 02:43:20,608 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2366 transitions. [2021-12-16 02:43:20,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2366 transitions. [2021-12-16 02:43:20,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:20,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2366 transitions. [2021-12-16 02:43:20,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.44444444444446) internal successors, (2366), 18 states have internal predecessors, (2366), 0 states have call successors, (0), 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-12-16 02:43:20,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 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-12-16 02:43:20,614 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 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-12-16 02:43:20,614 INFO L186 Difference]: Start difference. First operand has 262 places, 257 transitions, 2303 flow. Second operand 18 states and 2366 transitions. [2021-12-16 02:43:20,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 343 transitions, 3304 flow [2021-12-16 02:43:20,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 343 transitions, 3220 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-12-16 02:43:20,714 INFO L242 Difference]: Finished difference. Result has 277 places, 264 transitions, 2532 flow [2021-12-16 02:43:20,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2532, PETRI_PLACES=277, PETRI_TRANSITIONS=264} [2021-12-16 02:43:20,715 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2021-12-16 02:43:20,715 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 264 transitions, 2532 flow [2021-12-16 02:43:20,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 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-12-16 02:43:20,715 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:20,715 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:20,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 02:43:20,716 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash -298806550, now seen corresponding path program 1 times [2021-12-16 02:43:20,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51590237] [2021-12-16 02:43:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:20,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:20,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:20,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51590237] [2021-12-16 02:43:20,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51590237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:20,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:20,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:43:20,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361377989] [2021-12-16 02:43:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:20,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:43:20,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:43:20,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:43:20,821 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:20,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 264 transitions, 2532 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 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-12-16 02:43:20,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:20,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:20,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:21,774 INFO L129 PetriNetUnfolder]: 1613/4451 cut-off events. [2021-12-16 02:43:21,774 INFO L130 PetriNetUnfolder]: For 41417/41659 co-relation queries the response was YES. [2021-12-16 02:43:21,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18053 conditions, 4451 events. 1613/4451 cut-off events. For 41417/41659 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 39672 event pairs, 187 based on Foata normal form. 235/4543 useless extension candidates. Maximal degree in co-relation 17748. Up to 1148 conditions per place. [2021-12-16 02:43:21,818 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 180 selfloop transitions, 64 changer transitions 30/384 dead transitions. [2021-12-16 02:43:21,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 384 transitions, 4138 flow [2021-12-16 02:43:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2021-12-16 02:43:21,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2021-12-16 02:43:21,826 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2021-12-16 02:43:21,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2021-12-16 02:43:21,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:21,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2021-12-16 02:43:21,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.58333333333334) internal successors, (1639), 12 states have internal predecessors, (1639), 0 states have call successors, (0), 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-12-16 02:43:21,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:21,830 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:21,830 INFO L186 Difference]: Start difference. First operand has 277 places, 264 transitions, 2532 flow. Second operand 12 states and 1639 transitions. [2021-12-16 02:43:21,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 384 transitions, 4138 flow [2021-12-16 02:43:21,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 384 transitions, 3937 flow, removed 56 selfloop flow, removed 9 redundant places. [2021-12-16 02:43:21,949 INFO L242 Difference]: Finished difference. Result has 284 places, 281 transitions, 2871 flow [2021-12-16 02:43:21,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2871, PETRI_PLACES=284, PETRI_TRANSITIONS=281} [2021-12-16 02:43:21,950 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 124 predicate places. [2021-12-16 02:43:21,950 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 281 transitions, 2871 flow [2021-12-16 02:43:21,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 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-12-16 02:43:21,950 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:21,950 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:21,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 02:43:21,950 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2068399984, now seen corresponding path program 1 times [2021-12-16 02:43:21,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:21,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441253680] [2021-12-16 02:43:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:21,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:22,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441253680] [2021-12-16 02:43:22,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441253680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:22,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:22,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:43:22,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305531327] [2021-12-16 02:43:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:22,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:43:22,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:43:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:43:22,072 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:22,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 281 transitions, 2871 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 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-12-16 02:43:22,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:22,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:22,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:23,057 INFO L129 PetriNetUnfolder]: 1365/4273 cut-off events. [2021-12-16 02:43:23,057 INFO L130 PetriNetUnfolder]: For 39998/40218 co-relation queries the response was YES. [2021-12-16 02:43:23,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16802 conditions, 4273 events. 1365/4273 cut-off events. For 39998/40218 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 39293 event pairs, 213 based on Foata normal form. 196/4329 useless extension candidates. Maximal degree in co-relation 16485. Up to 583 conditions per place. [2021-12-16 02:43:23,100 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 163 selfloop transitions, 79 changer transitions 38/390 dead transitions. [2021-12-16 02:43:23,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 390 transitions, 4235 flow [2021-12-16 02:43:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 02:43:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 02:43:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2021-12-16 02:43:23,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2021-12-16 02:43:23,103 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2021-12-16 02:43:23,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2021-12-16 02:43:23,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:23,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2021-12-16 02:43:23,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.125) internal successors, (2146), 16 states have internal predecessors, (2146), 0 states have call successors, (0), 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-12-16 02:43:23,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-12-16 02:43:23,108 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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-12-16 02:43:23,108 INFO L186 Difference]: Start difference. First operand has 284 places, 281 transitions, 2871 flow. Second operand 16 states and 2146 transitions. [2021-12-16 02:43:23,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 390 transitions, 4235 flow [2021-12-16 02:43:23,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 390 transitions, 4149 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-12-16 02:43:23,220 INFO L242 Difference]: Finished difference. Result has 301 places, 283 transitions, 3026 flow [2021-12-16 02:43:23,220 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3026, PETRI_PLACES=301, PETRI_TRANSITIONS=283} [2021-12-16 02:43:23,221 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2021-12-16 02:43:23,221 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 283 transitions, 3026 flow [2021-12-16 02:43:23,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 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-12-16 02:43:23,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:23,221 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:23,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 02:43:23,222 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 983704946, now seen corresponding path program 2 times [2021-12-16 02:43:23,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262466119] [2021-12-16 02:43:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:23,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:23,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262466119] [2021-12-16 02:43:23,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262466119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:23,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:23,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 02:43:23,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585622587] [2021-12-16 02:43:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:23,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 02:43:23,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 02:43:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-16 02:43:23,329 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:23,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 283 transitions, 3026 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 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-12-16 02:43:23,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:23,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:23,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:24,188 INFO L129 PetriNetUnfolder]: 1279/3994 cut-off events. [2021-12-16 02:43:24,188 INFO L130 PetriNetUnfolder]: For 42757/42950 co-relation queries the response was YES. [2021-12-16 02:43:24,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16212 conditions, 3994 events. 1279/3994 cut-off events. For 42757/42950 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 36322 event pairs, 311 based on Foata normal form. 173/4018 useless extension candidates. Maximal degree in co-relation 15890. Up to 1133 conditions per place. [2021-12-16 02:43:24,227 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 163 selfloop transitions, 73 changer transitions 17/363 dead transitions. [2021-12-16 02:43:24,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 363 transitions, 4165 flow [2021-12-16 02:43:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2021-12-16 02:43:24,233 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2021-12-16 02:43:24,233 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2021-12-16 02:43:24,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2021-12-16 02:43:24,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:24,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2021-12-16 02:43:24,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.83333333333334) internal successors, (1618), 12 states have internal predecessors, (1618), 0 states have call successors, (0), 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-12-16 02:43:24,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:24,237 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:24,237 INFO L186 Difference]: Start difference. First operand has 301 places, 283 transitions, 3026 flow. Second operand 12 states and 1618 transitions. [2021-12-16 02:43:24,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 363 transitions, 4165 flow [2021-12-16 02:43:24,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 363 transitions, 4004 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-12-16 02:43:24,341 INFO L242 Difference]: Finished difference. Result has 305 places, 285 transitions, 3157 flow [2021-12-16 02:43:24,341 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2887, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3157, PETRI_PLACES=305, PETRI_TRANSITIONS=285} [2021-12-16 02:43:24,342 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 145 predicate places. [2021-12-16 02:43:24,342 INFO L470 AbstractCegarLoop]: Abstraction has has 305 places, 285 transitions, 3157 flow [2021-12-16 02:43:24,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 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-12-16 02:43:24,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:24,342 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:24,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 02:43:24,343 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash -119427466, now seen corresponding path program 2 times [2021-12-16 02:43:24,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:24,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091415622] [2021-12-16 02:43:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:24,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:24,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:24,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091415622] [2021-12-16 02:43:24,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091415622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:24,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:24,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 02:43:24,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287531009] [2021-12-16 02:43:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:24,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 02:43:24,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 02:43:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-16 02:43:24,442 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-12-16 02:43:24,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 285 transitions, 3157 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 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-12-16 02:43:24,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:24,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-12-16 02:43:24,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:25,344 INFO L129 PetriNetUnfolder]: 1065/3634 cut-off events. [2021-12-16 02:43:25,345 INFO L130 PetriNetUnfolder]: For 43261/43476 co-relation queries the response was YES. [2021-12-16 02:43:25,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14830 conditions, 3634 events. 1065/3634 cut-off events. For 43261/43476 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33291 event pairs, 211 based on Foata normal form. 177/3688 useless extension candidates. Maximal degree in co-relation 14548. Up to 554 conditions per place. [2021-12-16 02:43:25,378 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 146 selfloop transitions, 90 changer transitions 22/363 dead transitions. [2021-12-16 02:43:25,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 363 transitions, 4195 flow [2021-12-16 02:43:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 02:43:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-16 02:43:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2363 transitions. [2021-12-16 02:43:25,381 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173649058894961 [2021-12-16 02:43:25,381 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2363 transitions. [2021-12-16 02:43:25,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2363 transitions. [2021-12-16 02:43:25,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:25,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2363 transitions. [2021-12-16 02:43:25,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.27777777777777) internal successors, (2363), 18 states have internal predecessors, (2363), 0 states have call successors, (0), 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-12-16 02:43:25,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 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-12-16 02:43:25,386 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 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-12-16 02:43:25,386 INFO L186 Difference]: Start difference. First operand has 305 places, 285 transitions, 3157 flow. Second operand 18 states and 2363 transitions. [2021-12-16 02:43:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 363 transitions, 4195 flow [2021-12-16 02:43:25,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 363 transitions, 4118 flow, removed 1 selfloop flow, removed 7 redundant places. [2021-12-16 02:43:25,487 INFO L242 Difference]: Finished difference. Result has 316 places, 276 transitions, 3246 flow [2021-12-16 02:43:25,487 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3041, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3246, PETRI_PLACES=316, PETRI_TRANSITIONS=276} [2021-12-16 02:43:25,487 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 156 predicate places. [2021-12-16 02:43:25,488 INFO L470 AbstractCegarLoop]: Abstraction has has 316 places, 276 transitions, 3246 flow [2021-12-16 02:43:25,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 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-12-16 02:43:25,488 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:25,488 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:25,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 02:43:25,488 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1264889957, now seen corresponding path program 1 times [2021-12-16 02:43:25,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056716603] [2021-12-16 02:43:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:25,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:25,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:25,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056716603] [2021-12-16 02:43:25,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056716603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:25,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:25,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:25,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903186766] [2021-12-16 02:43:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:25,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:25,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:25,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:25,549 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:25,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 276 transitions, 3246 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:25,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:25,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:25,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:26,014 INFO L129 PetriNetUnfolder]: 646/2571 cut-off events. [2021-12-16 02:43:26,015 INFO L130 PetriNetUnfolder]: For 28481/28566 co-relation queries the response was YES. [2021-12-16 02:43:26,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10372 conditions, 2571 events. 646/2571 cut-off events. For 28481/28566 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21934 event pairs, 124 based on Foata normal form. 40/2521 useless extension candidates. Maximal degree in co-relation 10132. Up to 352 conditions per place. [2021-12-16 02:43:26,046 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 109 selfloop transitions, 37 changer transitions 60/346 dead transitions. [2021-12-16 02:43:26,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 346 transitions, 4157 flow [2021-12-16 02:43:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:43:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:43:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2021-12-16 02:43:26,048 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2021-12-16 02:43:26,048 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2021-12-16 02:43:26,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2021-12-16 02:43:26,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:26,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2021-12-16 02:43:26,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.72727272727272) internal successors, (1625), 11 states have internal predecessors, (1625), 0 states have call successors, (0), 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-12-16 02:43:26,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:26,052 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:26,052 INFO L186 Difference]: Start difference. First operand has 316 places, 276 transitions, 3246 flow. Second operand 11 states and 1625 transitions. [2021-12-16 02:43:26,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 346 transitions, 4157 flow [2021-12-16 02:43:26,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 346 transitions, 3783 flow, removed 25 selfloop flow, removed 23 redundant places. [2021-12-16 02:43:26,126 INFO L242 Difference]: Finished difference. Result has 301 places, 244 transitions, 2419 flow [2021-12-16 02:43:26,126 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2918, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2419, PETRI_PLACES=301, PETRI_TRANSITIONS=244} [2021-12-16 02:43:26,126 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2021-12-16 02:43:26,127 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 244 transitions, 2419 flow [2021-12-16 02:43:26,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:26,127 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:26,127 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:26,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 02:43:26,127 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1242452331, now seen corresponding path program 2 times [2021-12-16 02:43:26,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:26,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008313756] [2021-12-16 02:43:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:26,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:26,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-12-16 02:43:26,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:26,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008313756] [2021-12-16 02:43:26,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008313756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:26,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:26,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:26,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769545706] [2021-12-16 02:43:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:26,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:26,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:26,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:26,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 244 transitions, 2419 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:26,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:26,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:26,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:26,632 INFO L129 PetriNetUnfolder]: 590/2216 cut-off events. [2021-12-16 02:43:26,632 INFO L130 PetriNetUnfolder]: For 19056/19117 co-relation queries the response was YES. [2021-12-16 02:43:26,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8406 conditions, 2216 events. 590/2216 cut-off events. For 19056/19117 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17722 event pairs, 125 based on Foata normal form. 28/2151 useless extension candidates. Maximal degree in co-relation 8347. Up to 363 conditions per place. [2021-12-16 02:43:26,652 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 45 changer transitions 25/320 dead transitions. [2021-12-16 02:43:26,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 320 transitions, 3451 flow [2021-12-16 02:43:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2021-12-16 02:43:26,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2021-12-16 02:43:26,654 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2021-12-16 02:43:26,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2021-12-16 02:43:26,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:26,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2021-12-16 02:43:26,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.25) internal successors, (1767), 12 states have internal predecessors, (1767), 0 states have call successors, (0), 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-12-16 02:43:26,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:26,658 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:26,658 INFO L186 Difference]: Start difference. First operand has 301 places, 244 transitions, 2419 flow. Second operand 12 states and 1767 transitions. [2021-12-16 02:43:26,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 320 transitions, 3451 flow [2021-12-16 02:43:26,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 320 transitions, 3011 flow, removed 39 selfloop flow, removed 31 redundant places. [2021-12-16 02:43:26,696 INFO L242 Difference]: Finished difference. Result has 286 places, 255 transitions, 2337 flow [2021-12-16 02:43:26,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2337, PETRI_PLACES=286, PETRI_TRANSITIONS=255} [2021-12-16 02:43:26,696 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 126 predicate places. [2021-12-16 02:43:26,697 INFO L470 AbstractCegarLoop]: Abstraction has has 286 places, 255 transitions, 2337 flow [2021-12-16 02:43:26,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:26,697 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:26,697 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:26,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 02:43:26,697 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -373271357, now seen corresponding path program 3 times [2021-12-16 02:43:26,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815418076] [2021-12-16 02:43:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:26,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:26,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:26,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815418076] [2021-12-16 02:43:26,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815418076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:26,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:26,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:26,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089774877] [2021-12-16 02:43:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:26,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:26,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:26,764 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:26,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 255 transitions, 2337 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:26,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:26,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:26,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:27,102 INFO L129 PetriNetUnfolder]: 534/2041 cut-off events. [2021-12-16 02:43:27,102 INFO L130 PetriNetUnfolder]: For 13223/13296 co-relation queries the response was YES. [2021-12-16 02:43:27,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7206 conditions, 2041 events. 534/2041 cut-off events. For 13223/13296 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15960 event pairs, 104 based on Foata normal form. 45/1975 useless extension candidates. Maximal degree in co-relation 7156. Up to 281 conditions per place. [2021-12-16 02:43:27,121 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 105 selfloop transitions, 52 changer transitions 36/333 dead transitions. [2021-12-16 02:43:27,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 333 transitions, 3357 flow [2021-12-16 02:43:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 02:43:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-16 02:43:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2021-12-16 02:43:27,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2021-12-16 02:43:27,124 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2021-12-16 02:43:27,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2021-12-16 02:43:27,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:27,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2021-12-16 02:43:27,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.41666666666666) internal successors, (1769), 12 states have internal predecessors, (1769), 0 states have call successors, (0), 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-12-16 02:43:27,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:27,128 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 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-12-16 02:43:27,128 INFO L186 Difference]: Start difference. First operand has 286 places, 255 transitions, 2337 flow. Second operand 12 states and 1769 transitions. [2021-12-16 02:43:27,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 333 transitions, 3357 flow [2021-12-16 02:43:27,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 333 transitions, 3284 flow, removed 21 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:27,157 INFO L242 Difference]: Finished difference. Result has 297 places, 261 transitions, 2500 flow [2021-12-16 02:43:27,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2500, PETRI_PLACES=297, PETRI_TRANSITIONS=261} [2021-12-16 02:43:27,158 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 137 predicate places. [2021-12-16 02:43:27,158 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 261 transitions, 2500 flow [2021-12-16 02:43:27,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:27,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:27,159 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:27,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 02:43:27,159 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash 310787751, now seen corresponding path program 4 times [2021-12-16 02:43:27,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:27,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745870517] [2021-12-16 02:43:27,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:27,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:27,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:27,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745870517] [2021-12-16 02:43:27,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745870517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:27,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:27,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:43:27,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686663937] [2021-12-16 02:43:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:27,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:43:27,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:43:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:43:27,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-16 02:43:27,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 261 transitions, 2500 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-16 02:43:27,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:27,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-16 02:43:27,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:27,463 INFO L129 PetriNetUnfolder]: 428/1960 cut-off events. [2021-12-16 02:43:27,464 INFO L130 PetriNetUnfolder]: For 14601/14700 co-relation queries the response was YES. [2021-12-16 02:43:27,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6852 conditions, 1960 events. 428/1960 cut-off events. For 14601/14700 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15574 event pairs, 105 based on Foata normal form. 49/1884 useless extension candidates. Maximal degree in co-relation 6798. Up to 345 conditions per place. [2021-12-16 02:43:27,480 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 91 selfloop transitions, 10 changer transitions 8/283 dead transitions. [2021-12-16 02:43:27,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 283 transitions, 2911 flow [2021-12-16 02:43:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 02:43:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 02:43:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-12-16 02:43:27,481 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2021-12-16 02:43:27,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-12-16 02:43:27,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-12-16 02:43:27,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:27,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-12-16 02:43:27,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 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-12-16 02:43:27,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 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-12-16 02:43:27,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 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-12-16 02:43:27,483 INFO L186 Difference]: Start difference. First operand has 297 places, 261 transitions, 2500 flow. Second operand 4 states and 643 transitions. [2021-12-16 02:43:27,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 283 transitions, 2911 flow [2021-12-16 02:43:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 283 transitions, 2781 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-16 02:43:27,512 INFO L242 Difference]: Finished difference. Result has 294 places, 260 transitions, 2410 flow [2021-12-16 02:43:27,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2410, PETRI_PLACES=294, PETRI_TRANSITIONS=260} [2021-12-16 02:43:27,513 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 134 predicate places. [2021-12-16 02:43:27,513 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 260 transitions, 2410 flow [2021-12-16 02:43:27,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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-12-16 02:43:27,514 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:27,514 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:27,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 02:43:27,514 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1467625197, now seen corresponding path program 5 times [2021-12-16 02:43:27,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:27,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180535337] [2021-12-16 02:43:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:27,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:27,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180535337] [2021-12-16 02:43:27,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180535337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:27,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:27,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:27,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078006885] [2021-12-16 02:43:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:27,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:27,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:27,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:27,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 260 transitions, 2410 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:27,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:27,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:27,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:27,993 INFO L129 PetriNetUnfolder]: 489/2040 cut-off events. [2021-12-16 02:43:27,993 INFO L130 PetriNetUnfolder]: For 14684/14849 co-relation queries the response was YES. [2021-12-16 02:43:28,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7334 conditions, 2040 events. 489/2040 cut-off events. For 14684/14849 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16304 event pairs, 112 based on Foata normal form. 96/2018 useless extension candidates. Maximal degree in co-relation 7278. Up to 261 conditions per place. [2021-12-16 02:43:28,015 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 100 selfloop transitions, 52 changer transitions 42/334 dead transitions. [2021-12-16 02:43:28,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 334 transitions, 3498 flow [2021-12-16 02:43:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 02:43:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-16 02:43:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2021-12-16 02:43:28,017 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2021-12-16 02:43:28,017 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2021-12-16 02:43:28,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2021-12-16 02:43:28,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:28,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2021-12-16 02:43:28,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.21428571428572) internal successors, (2047), 14 states have internal predecessors, (2047), 0 states have call successors, (0), 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-12-16 02:43:28,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 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-12-16 02:43:28,021 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 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-12-16 02:43:28,021 INFO L186 Difference]: Start difference. First operand has 294 places, 260 transitions, 2410 flow. Second operand 14 states and 2047 transitions. [2021-12-16 02:43:28,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 334 transitions, 3498 flow [2021-12-16 02:43:28,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 334 transitions, 3442 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-12-16 02:43:28,054 INFO L242 Difference]: Finished difference. Result has 308 places, 260 transitions, 2561 flow [2021-12-16 02:43:28,054 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2561, PETRI_PLACES=308, PETRI_TRANSITIONS=260} [2021-12-16 02:43:28,054 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 148 predicate places. [2021-12-16 02:43:28,054 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 260 transitions, 2561 flow [2021-12-16 02:43:28,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:28,055 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:28,055 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:28,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 02:43:28,055 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1663738535, now seen corresponding path program 1 times [2021-12-16 02:43:28,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:28,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103591024] [2021-12-16 02:43:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:28,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:28,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:28,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103591024] [2021-12-16 02:43:28,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103591024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:28,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:28,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:28,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703253702] [2021-12-16 02:43:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:28,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:28,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:28,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:28,125 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:28,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 260 transitions, 2561 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:28,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:28,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:28,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:28,455 INFO L129 PetriNetUnfolder]: 415/1837 cut-off events. [2021-12-16 02:43:28,455 INFO L130 PetriNetUnfolder]: For 15337/15506 co-relation queries the response was YES. [2021-12-16 02:43:28,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6867 conditions, 1837 events. 415/1837 cut-off events. For 15337/15506 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 14182 event pairs, 88 based on Foata normal form. 110/1846 useless extension candidates. Maximal degree in co-relation 6808. Up to 290 conditions per place. [2021-12-16 02:43:28,474 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 92 selfloop transitions, 39 changer transitions 43/300 dead transitions. [2021-12-16 02:43:28,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 300 transitions, 3232 flow [2021-12-16 02:43:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:43:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:43:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1598 transitions. [2021-12-16 02:43:28,476 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.793840039741679 [2021-12-16 02:43:28,477 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1598 transitions. [2021-12-16 02:43:28,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1598 transitions. [2021-12-16 02:43:28,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:28,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1598 transitions. [2021-12-16 02:43:28,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.27272727272728) internal successors, (1598), 11 states have internal predecessors, (1598), 0 states have call successors, (0), 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-12-16 02:43:28,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:28,481 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:28,481 INFO L186 Difference]: Start difference. First operand has 308 places, 260 transitions, 2561 flow. Second operand 11 states and 1598 transitions. [2021-12-16 02:43:28,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 300 transitions, 3232 flow [2021-12-16 02:43:28,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 300 transitions, 3110 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-12-16 02:43:28,517 INFO L242 Difference]: Finished difference. Result has 305 places, 229 transitions, 1945 flow [2021-12-16 02:43:28,517 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2448, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1945, PETRI_PLACES=305, PETRI_TRANSITIONS=229} [2021-12-16 02:43:28,517 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 145 predicate places. [2021-12-16 02:43:28,518 INFO L470 AbstractCegarLoop]: Abstraction has has 305 places, 229 transitions, 1945 flow [2021-12-16 02:43:28,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:28,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:28,518 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:28,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 02:43:28,519 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2066791715, now seen corresponding path program 2 times [2021-12-16 02:43:28,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:28,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423861933] [2021-12-16 02:43:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:28,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:28,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423861933] [2021-12-16 02:43:28,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423861933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:28,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:28,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:28,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327086705] [2021-12-16 02:43:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:28,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:28,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:28,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:28,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 229 transitions, 1945 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:28,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:28,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:28,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:28,891 INFO L129 PetriNetUnfolder]: 283/1368 cut-off events. [2021-12-16 02:43:28,892 INFO L130 PetriNetUnfolder]: For 8441/8567 co-relation queries the response was YES. [2021-12-16 02:43:28,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4756 conditions, 1368 events. 283/1368 cut-off events. For 8441/8567 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9381 event pairs, 60 based on Foata normal form. 99/1379 useless extension candidates. Maximal degree in co-relation 4702. Up to 139 conditions per place. [2021-12-16 02:43:28,904 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 93 selfloop transitions, 43 changer transitions 27/282 dead transitions. [2021-12-16 02:43:28,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 282 transitions, 2798 flow [2021-12-16 02:43:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:43:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:43:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1608 transitions. [2021-12-16 02:43:28,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7988077496274217 [2021-12-16 02:43:28,906 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1608 transitions. [2021-12-16 02:43:28,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1608 transitions. [2021-12-16 02:43:28,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:28,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1608 transitions. [2021-12-16 02:43:28,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.1818181818182) internal successors, (1608), 11 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-12-16 02:43:28,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:28,910 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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-12-16 02:43:28,910 INFO L186 Difference]: Start difference. First operand has 305 places, 229 transitions, 1945 flow. Second operand 11 states and 1608 transitions. [2021-12-16 02:43:28,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 282 transitions, 2798 flow [2021-12-16 02:43:28,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 282 transitions, 2434 flow, removed 9 selfloop flow, removed 35 redundant places. [2021-12-16 02:43:28,931 INFO L242 Difference]: Finished difference. Result has 280 places, 227 transitions, 1806 flow [2021-12-16 02:43:28,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1806, PETRI_PLACES=280, PETRI_TRANSITIONS=227} [2021-12-16 02:43:28,932 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 120 predicate places. [2021-12-16 02:43:28,932 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 227 transitions, 1806 flow [2021-12-16 02:43:28,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:28,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:28,932 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:28,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 02:43:28,932 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash -741859526, now seen corresponding path program 1 times [2021-12-16 02:43:28,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:28,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669956910] [2021-12-16 02:43:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:28,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:28,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:28,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669956910] [2021-12-16 02:43:28,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669956910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:28,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:28,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:28,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525185115] [2021-12-16 02:43:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:28,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:28,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:28,992 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:28,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 227 transitions, 1806 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:28,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:28,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:28,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:29,213 INFO L129 PetriNetUnfolder]: 227/1071 cut-off events. [2021-12-16 02:43:29,213 INFO L130 PetriNetUnfolder]: For 5286/5411 co-relation queries the response was YES. [2021-12-16 02:43:29,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1071 events. 227/1071 cut-off events. For 5286/5411 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6690 event pairs, 50 based on Foata normal form. 94/1081 useless extension candidates. Maximal degree in co-relation 3522. Up to 140 conditions per place. [2021-12-16 02:43:29,222 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 46 selfloop transitions, 19 changer transitions 81/252 dead transitions. [2021-12-16 02:43:29,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 252 transitions, 2301 flow [2021-12-16 02:43:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:43:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:43:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1444 transitions. [2021-12-16 02:43:29,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7890710382513662 [2021-12-16 02:43:29,224 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1444 transitions. [2021-12-16 02:43:29,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1444 transitions. [2021-12-16 02:43:29,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:29,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1444 transitions. [2021-12-16 02:43:29,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 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-12-16 02:43:29,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:29,231 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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-12-16 02:43:29,231 INFO L186 Difference]: Start difference. First operand has 280 places, 227 transitions, 1806 flow. Second operand 10 states and 1444 transitions. [2021-12-16 02:43:29,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 252 transitions, 2301 flow [2021-12-16 02:43:29,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 252 transitions, 2192 flow, removed 18 selfloop flow, removed 9 redundant places. [2021-12-16 02:43:29,253 INFO L242 Difference]: Finished difference. Result has 277 places, 162 transitions, 955 flow [2021-12-16 02:43:29,253 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=955, PETRI_PLACES=277, PETRI_TRANSITIONS=162} [2021-12-16 02:43:29,254 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2021-12-16 02:43:29,254 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 162 transitions, 955 flow [2021-12-16 02:43:29,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 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-12-16 02:43:29,254 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:29,255 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:29,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 02:43:29,255 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1408593735, now seen corresponding path program 3 times [2021-12-16 02:43:29,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:29,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952818962] [2021-12-16 02:43:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:29,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:29,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:29,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952818962] [2021-12-16 02:43:29,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952818962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:29,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:29,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:29,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007930375] [2021-12-16 02:43:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:29,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:29,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:29,334 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:29,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 162 transitions, 955 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:29,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:29,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:29,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:29,500 INFO L129 PetriNetUnfolder]: 143/700 cut-off events. [2021-12-16 02:43:29,500 INFO L130 PetriNetUnfolder]: For 2723/2747 co-relation queries the response was YES. [2021-12-16 02:43:29,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2133 conditions, 700 events. 143/700 cut-off events. For 2723/2747 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3689 event pairs, 44 based on Foata normal form. 17/659 useless extension candidates. Maximal degree in co-relation 2088. Up to 84 conditions per place. [2021-12-16 02:43:29,506 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 44 selfloop transitions, 24 changer transitions 23/197 dead transitions. [2021-12-16 02:43:29,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 197 transitions, 1424 flow [2021-12-16 02:43:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:43:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:43:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1863 transitions. [2021-12-16 02:43:29,508 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7831021437578815 [2021-12-16 02:43:29,508 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1863 transitions. [2021-12-16 02:43:29,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1863 transitions. [2021-12-16 02:43:29,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:29,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1863 transitions. [2021-12-16 02:43:29,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.30769230769232) internal successors, (1863), 13 states have internal predecessors, (1863), 0 states have call successors, (0), 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-12-16 02:43:29,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-12-16 02:43:29,514 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 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-12-16 02:43:29,514 INFO L186 Difference]: Start difference. First operand has 277 places, 162 transitions, 955 flow. Second operand 13 states and 1863 transitions. [2021-12-16 02:43:29,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 197 transitions, 1424 flow [2021-12-16 02:43:29,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 197 transitions, 1041 flow, removed 22 selfloop flow, removed 60 redundant places. [2021-12-16 02:43:29,521 INFO L242 Difference]: Finished difference. Result has 205 places, 162 transitions, 737 flow [2021-12-16 02:43:29,521 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=737, PETRI_PLACES=205, PETRI_TRANSITIONS=162} [2021-12-16 02:43:29,522 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2021-12-16 02:43:29,522 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 162 transitions, 737 flow [2021-12-16 02:43:29,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:29,523 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:29,523 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:29,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-16 02:43:29,523 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash 924596831, now seen corresponding path program 4 times [2021-12-16 02:43:29,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520307222] [2021-12-16 02:43:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:29,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:29,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:29,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520307222] [2021-12-16 02:43:29,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520307222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:29,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:29,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 02:43:29,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679872002] [2021-12-16 02:43:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:29,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 02:43:29,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 02:43:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 02:43:29,594 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-12-16 02:43:29,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 162 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 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-12-16 02:43:29,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:29,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-12-16 02:43:29,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:29,662 INFO L129 PetriNetUnfolder]: 101/586 cut-off events. [2021-12-16 02:43:29,662 INFO L130 PetriNetUnfolder]: For 1533/1555 co-relation queries the response was YES. [2021-12-16 02:43:29,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 586 events. 101/586 cut-off events. For 1533/1555 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2737 event pairs, 31 based on Foata normal form. 15/548 useless extension candidates. Maximal degree in co-relation 1443. Up to 84 conditions per place. [2021-12-16 02:43:29,666 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 35 selfloop transitions, 8 changer transitions 2/168 dead transitions. [2021-12-16 02:43:29,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 168 transitions, 874 flow [2021-12-16 02:43:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 02:43:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 02:43:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2021-12-16 02:43:29,667 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2021-12-16 02:43:29,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2021-12-16 02:43:29,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2021-12-16 02:43:29,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:29,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2021-12-16 02:43:29,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:43:29,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 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-12-16 02:43:29,669 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 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-12-16 02:43:29,669 INFO L186 Difference]: Start difference. First operand has 205 places, 162 transitions, 737 flow. Second operand 4 states and 628 transitions. [2021-12-16 02:43:29,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 168 transitions, 874 flow [2021-12-16 02:43:29,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 168 transitions, 782 flow, removed 17 selfloop flow, removed 11 redundant places. [2021-12-16 02:43:29,674 INFO L242 Difference]: Finished difference. Result has 196 places, 162 transitions, 686 flow [2021-12-16 02:43:29,674 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=686, PETRI_PLACES=196, PETRI_TRANSITIONS=162} [2021-12-16 02:43:29,674 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 36 predicate places. [2021-12-16 02:43:29,675 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 162 transitions, 686 flow [2021-12-16 02:43:29,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 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-12-16 02:43:29,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:43:29,675 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:29,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-16 02:43:29,675 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-16 02:43:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:43:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2045095045, now seen corresponding path program 1 times [2021-12-16 02:43:29,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:43:29,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965245481] [2021-12-16 02:43:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:43:29,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:43:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:43:29,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:43:29,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:43:29,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965245481] [2021-12-16 02:43:29,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965245481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:43:29,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:43:29,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 02:43:29,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122723508] [2021-12-16 02:43:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:43:29,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 02:43:29,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:43:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 02:43:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-16 02:43:29,753 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-12-16 02:43:29,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 162 transitions, 686 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:29,754 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:43:29,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-12-16 02:43:29,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:43:29,852 INFO L129 PetriNetUnfolder]: 111/566 cut-off events. [2021-12-16 02:43:29,852 INFO L130 PetriNetUnfolder]: For 1741/1768 co-relation queries the response was YES. [2021-12-16 02:43:29,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 566 events. 111/566 cut-off events. For 1741/1768 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2592 event pairs, 22 based on Foata normal form. 20/534 useless extension candidates. Maximal degree in co-relation 1451. Up to 79 conditions per place. [2021-12-16 02:43:29,855 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 178/178 dead transitions. [2021-12-16 02:43:29,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 178 transitions, 955 flow [2021-12-16 02:43:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:43:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 02:43:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1287 transitions. [2021-12-16 02:43:29,856 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7814207650273224 [2021-12-16 02:43:29,856 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1287 transitions. [2021-12-16 02:43:29,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1287 transitions. [2021-12-16 02:43:29,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:43:29,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1287 transitions. [2021-12-16 02:43:29,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.0) internal successors, (1287), 9 states have internal predecessors, (1287), 0 states have call successors, (0), 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-12-16 02:43:29,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 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-12-16 02:43:29,859 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 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-12-16 02:43:29,859 INFO L186 Difference]: Start difference. First operand has 196 places, 162 transitions, 686 flow. Second operand 9 states and 1287 transitions. [2021-12-16 02:43:29,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 178 transitions, 955 flow [2021-12-16 02:43:29,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 178 transitions, 933 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-12-16 02:43:29,863 INFO L242 Difference]: Finished difference. Result has 201 places, 0 transitions, 0 flow [2021-12-16 02:43:29,863 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=201, PETRI_TRANSITIONS=0} [2021-12-16 02:43:29,864 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2021-12-16 02:43:29,864 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 0 transitions, 0 flow [2021-12-16 02:43:29,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12-16 02:43:29,866 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-16 02:43:29,866 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-16 02:43:29,866 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-16 02:43:29,866 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-16 02:43:29,867 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-16 02:43:29,867 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-12-16 02:43:29,867 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-16 02:43:29,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-16 02:43:29,870 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:43:29,872 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-16 02:43:29,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 02:43:29,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:43:29 BasicIcfg [2021-12-16 02:43:29,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 02:43:29,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 02:43:29,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 02:43:29,875 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 02:43:29,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:43:03" (3/4) ... [2021-12-16 02:43:29,877 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 02:43:29,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2021-12-16 02:43:29,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2021-12-16 02:43:29,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2021-12-16 02:43:29,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-16 02:43:29,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-16 02:43:29,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 02:43:29,883 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 02:43:29,900 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 02:43:29,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 02:43:29,901 INFO L158 Benchmark]: Toolchain (without parser) took 27097.61ms. Allocated memory was 102.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 74.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 398.3MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,901 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 60.6MB in the beginning and 60.5MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 02:43:29,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.99ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 67.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.97ms. Allocated memory is still 102.8MB. Free memory was 67.5MB in the beginning and 64.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,902 INFO L158 Benchmark]: Boogie Preprocessor took 49.53ms. Allocated memory is still 102.8MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,902 INFO L158 Benchmark]: RCFGBuilder took 667.97ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 63.0MB in the beginning and 80.9MB in the end (delta: -17.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,902 INFO L158 Benchmark]: TraceAbstraction took 25899.50ms. Allocated memory was 123.7MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 80.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 379.5MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,902 INFO L158 Benchmark]: Witness Printer took 25.57ms. Allocated memory is still 3.3GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 02:43:29,903 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.17ms. Allocated memory is still 102.8MB. Free memory was 60.6MB in the beginning and 60.5MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.99ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 67.5MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.97ms. Allocated memory is still 102.8MB. Free memory was 67.5MB in the beginning and 64.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.53ms. Allocated memory is still 102.8MB. Free memory was 64.7MB in the beginning and 63.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 667.97ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 63.0MB in the beginning and 80.9MB in the end (delta: -17.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25899.50ms. Allocated memory was 123.7MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 80.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 379.5MB. Max. memory is 16.1GB. * Witness Printer took 25.57ms. Allocated memory is still 3.3GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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 with 1 thread instances CFG has 7 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.7s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2697 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2697 mSDsluCounter, 1679 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3057 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8218 IncrementalHoareTripleChecker+Invalid, 8826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 551 mSDtfsCounter, 8218 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3246occurred in iteration=21, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2690 NumberOfCodeBlocks, 2690 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2658 ConstructedInterpolants, 0 QuantifiedInterpolants, 13354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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! [2021-12-16 02:43:29,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE