/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 19:05:05,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 19:05:05,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 19:05:05,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 19:05:05,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 19:05:05,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 19:05:05,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 19:05:05,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 19:05:05,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 19:05:05,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 19:05:05,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 19:05:05,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 19:05:05,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 19:05:05,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 19:05:05,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 19:05:05,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 19:05:05,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 19:05:05,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 19:05:05,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 19:05:05,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 19:05:05,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 19:05:05,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 19:05:05,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 19:05:05,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 19:05:05,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 19:05:05,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 19:05:05,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 19:05:05,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 19:05:05,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 19:05:05,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 19:05:05,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 19:05:05,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 19:05:05,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 19:05:05,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 19:05:05,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 19:05:05,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 19:05:05,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 19:05:05,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 19:05:05,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 19:05:05,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 19:05:05,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 19:05:05,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 19:05:05,441 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 19:05:05,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 19:05:05,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 19:05:05,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 19:05:05,444 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 19:05:05,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 19:05:05,444 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 19:05:05,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 19:05:05,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 19:05:05,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 19:05:05,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 19:05:05,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 19:05:05,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 19:05:05,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 19:05:05,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 19:05:05,447 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 19:05:05,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 19:05:05,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 19:05:05,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 19:05:05,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 19:05:05,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 19:05:05,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:05:05,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 19:05:05,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 19:05:05,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 19:05:05,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 19:05:05,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 19:05:05,449 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 19:05:05,449 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 [2021-03-11 19:05:05,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 19:05:05,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 19:05:05,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 19:05:05,778 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 19:05:05,779 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 19:05:05,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-11 19:05:05,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f371ffd/ff1bcc3eef8a43e7af0e1462f04d13a0/FLAG1ad9c6bb9 [2021-03-11 19:05:06,355 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 19:05:06,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-11 19:05:06,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f371ffd/ff1bcc3eef8a43e7af0e1462f04d13a0/FLAG1ad9c6bb9 [2021-03-11 19:05:06,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f371ffd/ff1bcc3eef8a43e7af0e1462f04d13a0 [2021-03-11 19:05:06,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 19:05:06,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 19:05:06,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 19:05:06,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 19:05:06,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 19:05:06,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:05:06" (1/1) ... [2021-03-11 19:05:06,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d457bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:06, skipping insertion in model container [2021-03-11 19:05:06,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:05:06" (1/1) ... [2021-03-11 19:05:06,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 19:05:06,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 19:05:06,961 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-03-11 19:05:06,968 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-03-11 19:05:06,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:05:06,998 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 19:05:07,049 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2021-03-11 19:05:07,050 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2021-03-11 19:05:07,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:05:07,122 INFO L208 MainTranslator]: Completed translation [2021-03-11 19:05:07,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07 WrapperNode [2021-03-11 19:05:07,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 19:05:07,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 19:05:07,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 19:05:07,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 19:05:07,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 19:05:07,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 19:05:07,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 19:05:07,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 19:05:07,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... [2021-03-11 19:05:07,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 19:05:07,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 19:05:07,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 19:05:07,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 19:05:07,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:05:07,265 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-03-11 19:05:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-03-11 19:05:07,265 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-03-11 19:05:07,265 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-03-11 19:05:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 19:05:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 19:05:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 19:05:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 19:05:07,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 19:05:07,268 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 19:05:08,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 19:05:08,130 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-11 19:05:08,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:05:08 BoogieIcfgContainer [2021-03-11 19:05:08,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 19:05:08,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 19:05:08,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 19:05:08,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 19:05:08,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 07:05:06" (1/3) ... [2021-03-11 19:05:08,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7bd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:05:08, skipping insertion in model container [2021-03-11 19:05:08,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:05:07" (2/3) ... [2021-03-11 19:05:08,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d7bd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:05:08, skipping insertion in model container [2021-03-11 19:05:08,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:05:08" (3/3) ... [2021-03-11 19:05:08,144 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-03-11 19:05:08,150 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 19:05:08,154 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 19:05:08,154 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 19:05:08,213 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,213 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,213 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,213 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,214 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,215 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,217 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,217 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,217 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,217 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,217 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,218 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,218 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,218 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,219 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,220 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,220 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,220 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,220 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,221 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,221 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,221 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,221 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,221 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,222 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,226 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,226 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,226 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,227 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,228 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,229 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,230 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,231 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,232 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,232 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,232 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,232 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,232 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,233 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,233 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,233 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,234 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,234 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,236 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,236 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,236 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,236 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,241 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,242 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,243 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,244 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,245 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,245 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,245 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,245 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,245 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,248 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,248 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,248 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,248 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,248 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,249 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,250 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,251 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,253 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,254 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,255 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,256 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,257 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,257 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,257 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,257 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,262 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,263 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,264 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,264 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,264 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,264 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,264 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,265 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,265 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,268 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,268 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,268 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,268 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,270 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,271 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,272 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,273 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,274 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,275 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,276 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,277 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,278 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,279 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,280 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,281 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,282 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,283 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,284 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,290 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,290 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,290 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,290 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,291 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,292 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,292 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,292 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,293 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,294 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,295 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,296 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,297 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,298 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_~readerstart2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_take_snapshot_#in~readerstart2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,299 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,300 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:05:08,306 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-11 19:05:08,321 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 19:05:08,343 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 19:05:08,343 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 19:05:08,344 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 19:05:08,344 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 19:05:08,344 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 19:05:08,344 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 19:05:08,344 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 19:05:08,344 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 19:05:08,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-03-11 19:05:08,429 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-03-11 19:05:08,429 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-11 19:05:08,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 183 events. 23/183 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 449 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-03-11 19:05:08,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-03-11 19:05:08,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-03-11 19:05:08,447 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 19:05:08,455 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-11 19:05:08,457 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-11 19:05:08,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-03-11 19:05:08,484 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-03-11 19:05:08,484 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-11 19:05:08,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 170 events. 21/170 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 433 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2021-03-11 19:05:08,491 INFO L116 LiptonReduction]: Number of co-enabled transitions 10120 [2021-03-11 19:05:13,826 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-11 19:05:13,990 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-11 19:05:14,419 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2021-03-11 19:05:14,582 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-11 19:05:15,056 WARN L205 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2021-03-11 19:05:15,226 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-11 19:05:15,240 INFO L131 LiptonReduction]: Checked pairs total: 26305 [2021-03-11 19:05:15,241 INFO L133 LiptonReduction]: Total number of compositions: 119 [2021-03-11 19:05:15,242 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6797 [2021-03-11 19:05:15,264 INFO L129 PetriNetUnfolder]: 9/47 cut-off events. [2021-03-11 19:05:15,264 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-11 19:05:15,265 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:15,265 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:15,266 INFO L428 AbstractCegarLoop]: === Iteration 1 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash 812364116, now seen corresponding path program 1 times [2021-03-11 19:05:15,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:15,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454009195] [2021-03-11 19:05:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:15,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:15,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:15,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:15,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:05:15,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:15,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:15,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454009195] [2021-03-11 19:05:15,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:15,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:05:15,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929989345] [2021-03-11 19:05:15,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:15,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:15,510 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 294 [2021-03-11 19:05:15,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:15,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 294 [2021-03-11 19:05:15,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:15,580 INFO L129 PetriNetUnfolder]: 17/93 cut-off events. [2021-03-11 19:05:15,580 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-11 19:05:15,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 93 events. 17/93 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 265 event pairs, 0 based on Foata normal form. 28/103 useless extension candidates. Maximal degree in co-relation 104. Up to 13 conditions per place. [2021-03-11 19:05:15,584 INFO L132 encePairwiseOnDemand]: 288/294 looper letters, 14 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2021-03-11 19:05:15,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 197 flow [2021-03-11 19:05:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2021-03-11 19:05:15,602 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8616780045351474 [2021-03-11 19:05:15,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2021-03-11 19:05:15,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2021-03-11 19:05:15,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:15,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2021-03-11 19:05:15,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,623 INFO L185 Difference]: Start difference. First operand has 60 places, 68 transitions, 163 flow. Second operand 3 states and 760 transitions. [2021-03-11 19:05:15,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 197 flow [2021-03-11 19:05:15,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 179 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-11 19:05:15,636 INFO L241 Difference]: Finished difference. Result has 58 places, 68 transitions, 163 flow [2021-03-11 19:05:15,637 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2021-03-11 19:05:15,638 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2021-03-11 19:05:15,638 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 163 flow [2021-03-11 19:05:15,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,639 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:15,639 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:15,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 19:05:15,640 INFO L428 AbstractCegarLoop]: === Iteration 2 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash -752568987, now seen corresponding path program 1 times [2021-03-11 19:05:15,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:15,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712821710] [2021-03-11 19:05:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:15,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:15,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:15,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:15,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:15,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712821710] [2021-03-11 19:05:15,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:15,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:05:15,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409627674] [2021-03-11 19:05:15,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:05:15,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:15,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:05:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:05:15,805 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 294 [2021-03-11 19:05:15,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:15,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 294 [2021-03-11 19:05:15,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:15,925 INFO L129 PetriNetUnfolder]: 260/696 cut-off events. [2021-03-11 19:05:15,925 INFO L130 PetriNetUnfolder]: For 39/48 co-relation queries the response was YES. [2021-03-11 19:05:15,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 696 events. 260/696 cut-off events. For 39/48 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4248 event pairs, 51 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 700. Up to 205 conditions per place. [2021-03-11 19:05:15,932 INFO L132 encePairwiseOnDemand]: 288/294 looper letters, 31 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2021-03-11 19:05:15,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 288 flow [2021-03-11 19:05:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:05:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:05:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1120 transitions. [2021-03-11 19:05:15,935 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2021-03-11 19:05:15,935 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1120 transitions. [2021-03-11 19:05:15,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1120 transitions. [2021-03-11 19:05:15,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:15,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1120 transitions. [2021-03-11 19:05:15,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,942 INFO L185 Difference]: Start difference. First operand has 58 places, 68 transitions, 163 flow. Second operand 5 states and 1120 transitions. [2021-03-11 19:05:15,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 288 flow [2021-03-11 19:05:15,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 90 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:05:15,946 INFO L241 Difference]: Finished difference. Result has 64 places, 73 transitions, 205 flow [2021-03-11 19:05:15,946 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2021-03-11 19:05:15,946 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2021-03-11 19:05:15,947 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 205 flow [2021-03-11 19:05:15,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:15,947 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:15,947 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:15,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 19:05:15,948 INFO L428 AbstractCegarLoop]: === Iteration 3 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -752569134, now seen corresponding path program 1 times [2021-03-11 19:05:15,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:15,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957438123] [2021-03-11 19:05:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:16,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:16,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957438123] [2021-03-11 19:05:16,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:16,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:05:16,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925846342] [2021-03-11 19:05:16,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:16,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:16,020 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 294 [2021-03-11 19:05:16,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:16,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 294 [2021-03-11 19:05:16,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:16,067 INFO L129 PetriNetUnfolder]: 83/385 cut-off events. [2021-03-11 19:05:16,068 INFO L130 PetriNetUnfolder]: For 28/34 co-relation queries the response was YES. [2021-03-11 19:05:16,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 385 events. 83/385 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2371 event pairs, 8 based on Foata normal form. 10/344 useless extension candidates. Maximal degree in co-relation 413. Up to 34 conditions per place. [2021-03-11 19:05:16,071 INFO L132 encePairwiseOnDemand]: 291/294 looper letters, 10 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2021-03-11 19:05:16,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 249 flow [2021-03-11 19:05:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2021-03-11 19:05:16,074 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8979591836734694 [2021-03-11 19:05:16,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2021-03-11 19:05:16,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2021-03-11 19:05:16,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:16,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2021-03-11 19:05:16,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,078 INFO L185 Difference]: Start difference. First operand has 64 places, 73 transitions, 205 flow. Second operand 3 states and 792 transitions. [2021-03-11 19:05:16,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 249 flow [2021-03-11 19:05:16,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 19:05:16,083 INFO L241 Difference]: Finished difference. Result has 67 places, 73 transitions, 213 flow [2021-03-11 19:05:16,083 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2021-03-11 19:05:16,083 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2021-03-11 19:05:16,083 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 213 flow [2021-03-11 19:05:16,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,084 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:16,084 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:16,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 19:05:16,084 INFO L428 AbstractCegarLoop]: === Iteration 4 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 370707334, now seen corresponding path program 1 times [2021-03-11 19:05:16,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:16,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235884416] [2021-03-11 19:05:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:16,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:16,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:16,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:16,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:16,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:16,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235884416] [2021-03-11 19:05:16,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:16,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:05:16,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808693591] [2021-03-11 19:05:16,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:05:16,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:05:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:05:16,187 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 294 [2021-03-11 19:05:16,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:16,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 294 [2021-03-11 19:05:16,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:16,675 INFO L129 PetriNetUnfolder]: 921/2043 cut-off events. [2021-03-11 19:05:16,675 INFO L130 PetriNetUnfolder]: For 116/119 co-relation queries the response was YES. [2021-03-11 19:05:16,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3990 conditions, 2043 events. 921/2043 cut-off events. For 116/119 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14836 event pairs, 62 based on Foata normal form. 104/1952 useless extension candidates. Maximal degree in co-relation 2898. Up to 425 conditions per place. [2021-03-11 19:05:16,695 INFO L132 encePairwiseOnDemand]: 271/294 looper letters, 94 selfloop transitions, 53 changer transitions 0/184 dead transitions. [2021-03-11 19:05:16,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 184 transitions, 834 flow [2021-03-11 19:05:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 19:05:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 19:05:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2148 transitions. [2021-03-11 19:05:16,700 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7306122448979592 [2021-03-11 19:05:16,700 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2148 transitions. [2021-03-11 19:05:16,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2148 transitions. [2021-03-11 19:05:16,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:16,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2148 transitions. [2021-03-11 19:05:16,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 214.8) internal successors, (2148), 10 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,711 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,712 INFO L185 Difference]: Start difference. First operand has 67 places, 73 transitions, 213 flow. Second operand 10 states and 2148 transitions. [2021-03-11 19:05:16,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 184 transitions, 834 flow [2021-03-11 19:05:16,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 184 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:05:16,724 INFO L241 Difference]: Finished difference. Result has 82 places, 134 transitions, 706 flow [2021-03-11 19:05:16,724 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=706, PETRI_PLACES=82, PETRI_TRANSITIONS=134} [2021-03-11 19:05:16,725 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2021-03-11 19:05:16,725 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 134 transitions, 706 flow [2021-03-11 19:05:16,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,726 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:16,727 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:16,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 19:05:16,727 INFO L428 AbstractCegarLoop]: === Iteration 5 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1688719851, now seen corresponding path program 1 times [2021-03-11 19:05:16,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:16,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442467004] [2021-03-11 19:05:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:16,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:16,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:16,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:16,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:16,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-03-11 19:05:16,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442467004] [2021-03-11 19:05:16,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:16,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:05:16,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825031381] [2021-03-11 19:05:16,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:05:16,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:05:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:05:16,822 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 294 [2021-03-11 19:05:16,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 134 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 211.6) internal successors, (1058), 5 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:16,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:16,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 294 [2021-03-11 19:05:16,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:17,128 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][122], [99#L771-3true, 100#qrcu_reader1EXITtrue, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 45#L744-3true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:17,128 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,129 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,129 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:17,129 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:17,176 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][122], [99#L771-3true, 100#qrcu_reader1EXITtrue, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 45#L744-3true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), 116#L787-1true, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:17,176 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-11 19:05:17,177 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,177 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-11 19:05:17,177 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,326 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][150], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,327 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,327 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:17,327 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:17,327 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:17,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][150], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), 116#L787-1true, Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,364 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:17,364 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,364 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,364 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,364 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][150], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0), 27#L739true]) [2021-03-11 19:05:17,364 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:17,365 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,365 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,365 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:17,398 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][150], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, 116#L787-1true, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0), 27#L739true]) [2021-03-11 19:05:17,398 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-11 19:05:17,398 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:17,398 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:17,398 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:17,449 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 213#true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,449 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-11 19:05:17,449 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:17,449 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:17,449 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:17,472 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 110#qrcu_reader2EXITtrue, Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), 116#L787-1true, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, 213#true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,473 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-11 19:05:17,473 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-11 19:05:17,473 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2021-03-11 19:05:17,473 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:17,497 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][92], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 51#L788-1true, Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0), 62#L777true, 95#L738true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0))]) [2021-03-11 19:05:17,498 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,498 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,498 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-11 19:05:17,498 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,501 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][158], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 173#(= ~readerprogress2~0 0), 51#L788-1true, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:17,502 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,502 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,502 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,502 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,502 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([953] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_274)) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_25| (select (select |v_#memory_int_115| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|)) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutex~0.base_40| (store (select |v_#pthreadsMutex_56| |v_~#mutex~0.base_40|) |v_~#mutex~0.offset_40| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_56|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, ~ctr1~0=v_~ctr1~0_274} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_55|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_25|, ~ctr1~0=v_~ctr1~0_274} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][135], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 51#L788-1true, Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 183#(= ~readerprogress1~0 0), 62#L777true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true]) [2021-03-11 19:05:17,502 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,503 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-11 19:05:17,503 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,503 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 110#qrcu_reader2EXITtrue, Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 51#L788-1true, Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 213#true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,508 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,508 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,508 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,508 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,511 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][27], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 171#true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 17#qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 51#L788-1true, Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:17,511 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,511 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,511 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,511 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,514 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([953] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_274)) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_25| (select (select |v_#memory_int_115| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|)) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutex~0.base_40| (store (select |v_#pthreadsMutex_56| |v_~#mutex~0.base_40|) |v_~#mutex~0.offset_40| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_56|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, ~ctr1~0=v_~ctr1~0_274} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_55|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_25|, ~ctr1~0=v_~ctr1~0_274} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][135], [167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 51#L788-1true, Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 183#(= ~readerprogress1~0 0), 27#L739true, 62#L777true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0))]) [2021-03-11 19:05:17,514 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,514 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-11 19:05:17,515 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,515 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-11 19:05:17,623 INFO L129 PetriNetUnfolder]: 2951/6213 cut-off events. [2021-03-11 19:05:17,623 INFO L130 PetriNetUnfolder]: For 6154/6756 co-relation queries the response was YES. [2021-03-11 19:05:17,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16417 conditions, 6213 events. 2951/6213 cut-off events. For 6154/6756 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 53877 event pairs, 401 based on Foata normal form. 226/5816 useless extension candidates. Maximal degree in co-relation 10193. Up to 1302 conditions per place. [2021-03-11 19:05:17,781 INFO L132 encePairwiseOnDemand]: 284/294 looper letters, 37 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2021-03-11 19:05:17,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 172 transitions, 957 flow [2021-03-11 19:05:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:05:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:05:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1520 transitions. [2021-03-11 19:05:17,786 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.738581146744412 [2021-03-11 19:05:17,786 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1520 transitions. [2021-03-11 19:05:17,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1520 transitions. [2021-03-11 19:05:17,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:17,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1520 transitions. [2021-03-11 19:05:17,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.14285714285714) internal successors, (1520), 7 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:17,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:17,793 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:17,794 INFO L185 Difference]: Start difference. First operand has 82 places, 134 transitions, 706 flow. Second operand 7 states and 1520 transitions. [2021-03-11 19:05:17,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 172 transitions, 957 flow [2021-03-11 19:05:17,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 172 transitions, 957 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 19:05:17,814 INFO L241 Difference]: Finished difference. Result has 90 places, 154 transitions, 887 flow [2021-03-11 19:05:17,814 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=887, PETRI_PLACES=90, PETRI_TRANSITIONS=154} [2021-03-11 19:05:17,814 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2021-03-11 19:05:17,815 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 154 transitions, 887 flow [2021-03-11 19:05:17,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 211.6) internal successors, (1058), 5 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:17,815 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:17,815 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:17,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 19:05:17,816 INFO L428 AbstractCegarLoop]: === Iteration 6 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1107037523, now seen corresponding path program 1 times [2021-03-11 19:05:17,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:17,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566433478] [2021-03-11 19:05:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:17,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:17,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:17,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:17,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:17,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566433478] [2021-03-11 19:05:17,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:17,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:05:17,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224552010] [2021-03-11 19:05:17,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:17,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:17,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:17,872 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 294 [2021-03-11 19:05:17,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 154 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:17,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:17,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 294 [2021-03-11 19:05:17,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:17,999 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][116], [Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 99#L771-3true, 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 45#L744-3true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:17,999 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,999 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:17,999 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-11 19:05:17,999 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:18,077 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][141], [Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 227#true, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 213#true, 152#L757true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:18,078 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-11 19:05:18,078 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,078 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,078 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,117 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 227#true, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 110#qrcu_reader2EXITtrue, Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 213#true, Black: 183#(= ~readerprogress1~0 0), 95#L738true]) [2021-03-11 19:05:18,117 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-11 19:05:18,117 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:18,117 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:18,117 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:18,135 INFO L129 PetriNetUnfolder]: 836/2353 cut-off events. [2021-03-11 19:05:18,135 INFO L130 PetriNetUnfolder]: For 2807/3007 co-relation queries the response was YES. [2021-03-11 19:05:18,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 2353 events. 836/2353 cut-off events. For 2807/3007 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20755 event pairs, 55 based on Foata normal form. 50/2234 useless extension candidates. Maximal degree in co-relation 5309. Up to 318 conditions per place. [2021-03-11 19:05:18,163 INFO L132 encePairwiseOnDemand]: 292/294 looper letters, 17 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2021-03-11 19:05:18,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 158 transitions, 951 flow [2021-03-11 19:05:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2021-03-11 19:05:18,165 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8979591836734694 [2021-03-11 19:05:18,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2021-03-11 19:05:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2021-03-11 19:05:18,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:18,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2021-03-11 19:05:18,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,170 INFO L185 Difference]: Start difference. First operand has 90 places, 154 transitions, 887 flow. Second operand 3 states and 792 transitions. [2021-03-11 19:05:18,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 158 transitions, 951 flow [2021-03-11 19:05:18,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 158 transitions, 951 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 19:05:18,182 INFO L241 Difference]: Finished difference. Result has 93 places, 154 transitions, 892 flow [2021-03-11 19:05:18,183 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=93, PETRI_TRANSITIONS=154} [2021-03-11 19:05:18,183 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2021-03-11 19:05:18,183 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 154 transitions, 892 flow [2021-03-11 19:05:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,184 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:18,184 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:18,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 19:05:18,184 INFO L428 AbstractCegarLoop]: === Iteration 7 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash 992118253, now seen corresponding path program 1 times [2021-03-11 19:05:18,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:18,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774993721] [2021-03-11 19:05:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:18,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:18,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:18,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774993721] [2021-03-11 19:05:18,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:18,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:05:18,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56917075] [2021-03-11 19:05:18,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:18,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:18,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:18,237 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 294 [2021-03-11 19:05:18,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 154 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:18,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 294 [2021-03-11 19:05:18,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:18,337 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([821] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork2_#t~post18_3| 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|} OutVars{qrcu_updaterThread1of1ForFork2_#t~post18=|v_qrcu_updaterThread1of1ForFork2_#t~post18_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][116], [Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 99#L771-3true, 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 232#true, Black: 165#true, 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 45#L744-3true, Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 173#(= ~readerprogress2~0 0), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:18,337 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-11 19:05:18,337 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:18,337 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-11 19:05:18,337 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-11 19:05:18,401 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][140], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 213#true, 21#L786-2true, 152#L757true, 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 227#true, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 229#(= ~readerprogress1~0 2), 232#true, Black: 165#true, 171#true, Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:18,401 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-11 19:05:18,401 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,401 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,401 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-11 19:05:18,431 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 227#true, 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 229#(= ~readerprogress1~0 2), Black: 165#true, 234#(= ~readerprogress2~0 2), 171#true, 110#qrcu_reader2EXITtrue, Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0)]) [2021-03-11 19:05:18,431 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-11 19:05:18,432 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:18,432 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:18,432 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:18,449 INFO L129 PetriNetUnfolder]: 855/2413 cut-off events. [2021-03-11 19:05:18,449 INFO L130 PetriNetUnfolder]: For 2880/3113 co-relation queries the response was YES. [2021-03-11 19:05:18,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 2413 events. 855/2413 cut-off events. For 2880/3113 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21369 event pairs, 56 based on Foata normal form. 69/2308 useless extension candidates. Maximal degree in co-relation 5384. Up to 336 conditions per place. [2021-03-11 19:05:18,476 INFO L132 encePairwiseOnDemand]: 292/294 looper letters, 18 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2021-03-11 19:05:18,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 158 transitions, 956 flow [2021-03-11 19:05:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2021-03-11 19:05:18,478 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9013605442176871 [2021-03-11 19:05:18,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2021-03-11 19:05:18,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2021-03-11 19:05:18,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:18,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2021-03-11 19:05:18,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,483 INFO L185 Difference]: Start difference. First operand has 93 places, 154 transitions, 892 flow. Second operand 3 states and 795 transitions. [2021-03-11 19:05:18,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 158 transitions, 956 flow [2021-03-11 19:05:18,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 158 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:05:18,495 INFO L241 Difference]: Finished difference. Result has 95 places, 154 transitions, 900 flow [2021-03-11 19:05:18,496 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=95, PETRI_TRANSITIONS=154} [2021-03-11 19:05:18,496 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2021-03-11 19:05:18,496 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 154 transitions, 900 flow [2021-03-11 19:05:18,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,496 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:18,496 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:18,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 19:05:18,497 INFO L428 AbstractCegarLoop]: === Iteration 8 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1592051601, now seen corresponding path program 1 times [2021-03-11 19:05:18,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:18,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541290371] [2021-03-11 19:05:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:18,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:18,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:18,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:18,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:18,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:18,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541290371] [2021-03-11 19:05:18,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:18,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:05:18,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153303344] [2021-03-11 19:05:18,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:05:18,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:05:18,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:05:18,553 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 294 [2021-03-11 19:05:18,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 154 transitions, 900 flow. Second operand has 5 states, 5 states have (on average 237.4) internal successors, (1187), 5 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:18,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:18,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 294 [2021-03-11 19:05:18,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:18,978 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([951] L739-->qrcu_reader1EXIT: Formula: (and (let ((.cse0 (<= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_15 0))) (or (and (= (+ v_~ctr2~0_286 1) v_~ctr2~0_287) (= v_~ctr1~0_251 v_~ctr1~0_250) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_15| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_41|) (not .cse0)) (and (= v_~ctr1~0_251 (+ v_~ctr1~0_250 1)) .cse0 (= v_~ctr2~0_287 v_~ctr2~0_286) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_15| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_41|)))) (= |v_qrcu_reader1Thread1of1ForFork0_#res.base_7| 0) (= v_qrcu_reader1Thread1of1ForFork0_~myidx~0_61 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_15|) (= |v_qrcu_reader1Thread1of1ForFork0_#res.offset_7| 0) (= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_15 |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_15|)) InVars {~ctr1~0=v_~ctr1~0_251, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_61, ~ctr2~0=v_~ctr2~0_287} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_15|, qrcu_reader1Thread1of1ForFork0_#res.offset=|v_qrcu_reader1Thread1of1ForFork0_#res.offset_7|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_15, ~ctr1~0=v_~ctr1~0_250, qrcu_reader1Thread1of1ForFork0_#res.base=|v_qrcu_reader1Thread1of1ForFork0_#res.base_7|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_61, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_15|, ~ctr2~0=v_~ctr2~0_286, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_15|} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_41|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_41|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8, qrcu_reader1Thread1of1ForFork0_#res.offset, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx, ~ctr1~0, qrcu_reader1Thread1of1ForFork0_#res.base, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7][146], [Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 232#true, Black: 165#true, Black: 234#(= ~readerprogress2~0 2), 237#true, 173#(= ~readerprogress2~0 0), 45#L744-3true, Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 183#(= ~readerprogress1~0 0), 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-03-11 19:05:18,978 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:18,978 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:18,978 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:18,978 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,031 INFO L129 PetriNetUnfolder]: 1570/4028 cut-off events. [2021-03-11 19:05:19,031 INFO L130 PetriNetUnfolder]: For 7050/7416 co-relation queries the response was YES. [2021-03-11 19:05:19,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11407 conditions, 4028 events. 1570/4028 cut-off events. For 7050/7416 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 37526 event pairs, 53 based on Foata normal form. 157/4025 useless extension candidates. Maximal degree in co-relation 10378. Up to 1046 conditions per place. [2021-03-11 19:05:19,080 INFO L132 encePairwiseOnDemand]: 283/294 looper letters, 57 selfloop transitions, 42 changer transitions 0/207 dead transitions. [2021-03-11 19:05:19,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 207 transitions, 1411 flow [2021-03-11 19:05:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:05:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:05:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1712 transitions. [2021-03-11 19:05:19,088 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8318756073858115 [2021-03-11 19:05:19,088 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1712 transitions. [2021-03-11 19:05:19,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1712 transitions. [2021-03-11 19:05:19,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:19,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1712 transitions. [2021-03-11 19:05:19,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 244.57142857142858) internal successors, (1712), 7 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,098 INFO L185 Difference]: Start difference. First operand has 95 places, 154 transitions, 900 flow. Second operand 7 states and 1712 transitions. [2021-03-11 19:05:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 207 transitions, 1411 flow [2021-03-11 19:05:19,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 207 transitions, 1410 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:05:19,119 INFO L241 Difference]: Finished difference. Result has 105 places, 186 transitions, 1291 flow [2021-03-11 19:05:19,119 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1291, PETRI_PLACES=105, PETRI_TRANSITIONS=186} [2021-03-11 19:05:19,120 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 45 predicate places. [2021-03-11 19:05:19,120 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 186 transitions, 1291 flow [2021-03-11 19:05:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 237.4) internal successors, (1187), 5 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,120 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:19,120 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:19,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 19:05:19,120 INFO L428 AbstractCegarLoop]: === Iteration 9 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1897488891, now seen corresponding path program 1 times [2021-03-11 19:05:19,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:19,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548324783] [2021-03-11 19:05:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:19,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:19,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:19,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:19,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:19,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548324783] [2021-03-11 19:05:19,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:19,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:05:19,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226827024] [2021-03-11 19:05:19,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:19,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:19,153 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 294 [2021-03-11 19:05:19,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 186 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:19,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 294 [2021-03-11 19:05:19,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:19,556 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][78], [Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 21#L786-2true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true, 62#L777true, 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-03-11 19:05:19,556 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,556 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,556 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,557 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,578 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][78], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true, 62#L777true]) [2021-03-11 19:05:19,579 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,579 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,579 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,579 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,590 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][78], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 171#true, 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true, 62#L777true]) [2021-03-11 19:05:19,590 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,590 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,590 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,590 INFO L387 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2021-03-11 19:05:19,598 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][145], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 152#L757true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, Black: 234#(= ~readerprogress2~0 2), 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 183#(= ~readerprogress1~0 0), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true]) [2021-03-11 19:05:19,598 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,598 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,598 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,598 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,600 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([953] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_274)) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_25| (select (select |v_#memory_int_115| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|)) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutex~0.base_40| (store (select |v_#pthreadsMutex_56| |v_~#mutex~0.base_40|) |v_~#mutex~0.offset_40| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_56|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, ~ctr1~0=v_~ctr1~0_274} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_55|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_25|, ~ctr1~0=v_~ctr1~0_274} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][135], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true, 62#L777true]) [2021-03-11 19:05:19,600 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2021-03-11 19:05:19,600 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([953] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_274)) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_25| (select (select |v_#memory_int_115| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|)) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#mutex~0.base_40| (store (select |v_#pthreadsMutex_56| |v_~#mutex~0.base_40|) |v_~#mutex~0.offset_40| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_56|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, ~ctr1~0=v_~ctr1~0_274} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_51|, #pthreadsMutex=|v_#pthreadsMutex_55|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_45|, ~#mutex~0.base=|v_~#mutex~0.base_40|, #memory_int=|v_#memory_int_115|, ~#mutex~0.offset=|v_~#mutex~0.offset_40|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_25|, ~ctr1~0=v_~ctr1~0_274} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][135], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 171#true, 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 183#(= ~readerprogress1~0 0), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true, 62#L777true]) [2021-03-11 19:05:19,601 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,601 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,607 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 229#(= ~readerprogress1~0 2), Black: 165#true, 234#(= ~readerprogress2~0 2), 171#true, 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 183#(= ~readerprogress1~0 0), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true]) [2021-03-11 19:05:19,607 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,607 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,607 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,607 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,610 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([764] L744-3-->L757: Formula: (= v_~readerprogress2~0_1 1) InVars {} OutVars{~readerprogress2~0=v_~readerprogress2~0_1} AuxVars[] AssignedVars[~readerprogress2~0][30], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 152#L757true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, Black: 234#(= ~readerprogress2~0 2), 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true]) [2021-03-11 19:05:19,610 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,610 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,610 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2021-03-11 19:05:19,610 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-11 19:05:19,611 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([978] L777-->qrcu_updaterEXIT: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25| (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|)) (= |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27| |v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|) (= |v_qrcu_updaterThread1of1ForFork2_#res.base_11| 0) (= v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62 v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61) (= v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25 |v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|) (= |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62| |v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|) (= |v_#valid_125| (store (store |v_#valid_126| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82| 0) |v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92| 0)) (= |v_qrcu_updaterThread1of1ForFork2_#res.offset_11| 0)) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_82|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_62|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_84|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_92|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_62, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_46|} OutVars{qrcu_updaterThread1of1ForFork2_#res.offset=|v_qrcu_updaterThread1of1ForFork2_#res.offset_11|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_73|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base_91|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2_25, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2_25|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond=v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond_61, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1_27|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10_25|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_45|, qrcu_updaterThread1of1ForFork2_#t~mem23=|v_qrcu_updaterThread1of1ForFork2_#t~mem23_31|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_81|, qrcu_updaterThread1of1ForFork2_#res.base=|v_qrcu_updaterThread1of1ForFork2_#res.base_11|, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond=|v_qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond_61|, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset_83|, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_185|, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1=v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1_27, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9=|v_qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9_27|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#res.offset, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#in~readerstart2, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#in~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_#t~nondet10, qrcu_updaterThread1of1ForFork2_#t~mem22, qrcu_updaterThread1of1ForFork2_#t~mem23, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base, qrcu_updaterThread1of1ForFork2_#res.base, qrcu_updaterThread1of1ForFork2_assume_abort_if_not_#in~cond, qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset, #valid, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1, qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_#t~nondet9][155], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 20#qrcu_updaterEXITtrue, 21#L786-2true, 213#true, 152#L757true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 100#qrcu_reader1EXITtrue, 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 171#true, Black: 234#(= ~readerprogress2~0 2), 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true]) [2021-03-11 19:05:19,612 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,615 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([741] L725-3-->L738: Formula: (= v_~readerprogress1~0_1 1) InVars {} OutVars{~readerprogress1~0=v_~readerprogress1~0_1} AuxVars[] AssignedVars[~readerprogress1~0][11], [203#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 193#(and (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 195#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 197#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (= ~ctr2~0 0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 199#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 201#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 188#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), 20#qrcu_updaterEXITtrue, Black: 191#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, 213#true, 95#L738true, Black: 215#(= ~readerprogress1~0 0), Black: 223#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 229#(= ~readerprogress1~0 2), 167#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 165#true, 234#(= ~readerprogress2~0 2), 171#true, 110#qrcu_reader2EXITtrue, 241#(<= 1 ~ctr2~0), Black: 176#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 173#(= ~readerprogress2~0 0), Black: 174#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 240#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 183#(= ~readerprogress1~0 0), Black: 245#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 237#true, Black: 239#(= ~ctr2~0 0), 252#true]) [2021-03-11 19:05:19,615 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-11 19:05:19,615 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,615 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,615 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,615 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-11 19:05:19,646 INFO L129 PetriNetUnfolder]: 2036/5407 cut-off events. [2021-03-11 19:05:19,646 INFO L130 PetriNetUnfolder]: For 9154/9542 co-relation queries the response was YES. [2021-03-11 19:05:19,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14965 conditions, 5407 events. 2036/5407 cut-off events. For 9154/9542 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 53534 event pairs, 115 based on Foata normal form. 160/4938 useless extension candidates. Maximal degree in co-relation 13514. Up to 590 conditions per place. [2021-03-11 19:05:19,692 INFO L132 encePairwiseOnDemand]: 291/294 looper letters, 24 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2021-03-11 19:05:19,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 170 transitions, 1212 flow [2021-03-11 19:05:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2021-03-11 19:05:19,695 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8605442176870748 [2021-03-11 19:05:19,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2021-03-11 19:05:19,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2021-03-11 19:05:19,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:19,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2021-03-11 19:05:19,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,702 INFO L185 Difference]: Start difference. First operand has 105 places, 186 transitions, 1291 flow. Second operand 3 states and 759 transitions. [2021-03-11 19:05:19,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 170 transitions, 1212 flow [2021-03-11 19:05:19,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 170 transitions, 1198 flow, removed 7 selfloop flow, removed 0 redundant places. [2021-03-11 19:05:19,744 INFO L241 Difference]: Finished difference. Result has 103 places, 164 transitions, 1138 flow [2021-03-11 19:05:19,745 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=103, PETRI_TRANSITIONS=164} [2021-03-11 19:05:19,745 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 43 predicate places. [2021-03-11 19:05:19,745 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 164 transitions, 1138 flow [2021-03-11 19:05:19,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,745 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:19,745 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:19,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 19:05:19,746 INFO L428 AbstractCegarLoop]: === Iteration 10 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1592050609, now seen corresponding path program 1 times [2021-03-11 19:05:19,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:19,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014287611] [2021-03-11 19:05:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:19,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:19,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:19,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:19,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:19,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:19,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:19,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014287611] [2021-03-11 19:05:19,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:19,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:05:19,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320081712] [2021-03-11 19:05:19,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:05:19,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:05:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:05:19,780 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 294 [2021-03-11 19:05:19,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 164 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:19,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:19,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 294 [2021-03-11 19:05:19,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:20,161 INFO L129 PetriNetUnfolder]: 1396/3814 cut-off events. [2021-03-11 19:05:20,162 INFO L130 PetriNetUnfolder]: For 7847/8134 co-relation queries the response was YES. [2021-03-11 19:05:20,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 3814 events. 1396/3814 cut-off events. For 7847/8134 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36502 event pairs, 113 based on Foata normal form. 72/3425 useless extension candidates. Maximal degree in co-relation 10435. Up to 448 conditions per place. [2021-03-11 19:05:20,240 INFO L132 encePairwiseOnDemand]: 292/294 looper letters, 24 selfloop transitions, 3 changer transitions 3/163 dead transitions. [2021-03-11 19:05:20,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 1169 flow [2021-03-11 19:05:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:05:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:05:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2021-03-11 19:05:20,245 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8594104308390023 [2021-03-11 19:05:20,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 758 transitions. [2021-03-11 19:05:20,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 758 transitions. [2021-03-11 19:05:20,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:20,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 758 transitions. [2021-03-11 19:05:20,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:20,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:20,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:20,249 INFO L185 Difference]: Start difference. First operand has 103 places, 164 transitions, 1138 flow. Second operand 3 states and 758 transitions. [2021-03-11 19:05:20,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 1169 flow [2021-03-11 19:05:20,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 163 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:05:20,285 INFO L241 Difference]: Finished difference. Result has 102 places, 154 transitions, 1073 flow [2021-03-11 19:05:20,286 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=102, PETRI_TRANSITIONS=154} [2021-03-11 19:05:20,286 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2021-03-11 19:05:20,286 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 154 transitions, 1073 flow [2021-03-11 19:05:20,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:20,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:20,287 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:20,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 19:05:20,287 INFO L428 AbstractCegarLoop]: === Iteration 11 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash -760887518, now seen corresponding path program 1 times [2021-03-11 19:05:20,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:20,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910916681] [2021-03-11 19:05:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:20,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:20,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:20,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:20,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:20,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:20,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:20,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:20,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:20,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:20,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910916681] [2021-03-11 19:05:20,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:20,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:05:20,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77707053] [2021-03-11 19:05:20,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:05:20,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:20,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:05:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:05:20,391 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 294 [2021-03-11 19:05:20,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 154 transitions, 1073 flow. Second operand has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:20,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:20,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 294 [2021-03-11 19:05:20,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:21,788 INFO L129 PetriNetUnfolder]: 4429/8747 cut-off events. [2021-03-11 19:05:21,789 INFO L130 PetriNetUnfolder]: For 20363/20575 co-relation queries the response was YES. [2021-03-11 19:05:21,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27781 conditions, 8747 events. 4429/8747 cut-off events. For 20363/20575 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 73310 event pairs, 205 based on Foata normal form. 217/7377 useless extension candidates. Maximal degree in co-relation 26752. Up to 1253 conditions per place. [2021-03-11 19:05:21,832 INFO L132 encePairwiseOnDemand]: 272/294 looper letters, 139 selfloop transitions, 57 changer transitions 204/422 dead transitions. [2021-03-11 19:05:21,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 422 transitions, 3457 flow [2021-03-11 19:05:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-11 19:05:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-11 19:05:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3082 transitions. [2021-03-11 19:05:21,840 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.655187074829932 [2021-03-11 19:05:21,840 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3082 transitions. [2021-03-11 19:05:21,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3082 transitions. [2021-03-11 19:05:21,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:21,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3082 transitions. [2021-03-11 19:05:21,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 192.625) internal successors, (3082), 16 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:21,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:21,856 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:21,856 INFO L185 Difference]: Start difference. First operand has 102 places, 154 transitions, 1073 flow. Second operand 16 states and 3082 transitions. [2021-03-11 19:05:21,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 422 transitions, 3457 flow [2021-03-11 19:05:22,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 422 transitions, 3451 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:05:22,012 INFO L241 Difference]: Finished difference. Result has 129 places, 133 transitions, 1132 flow [2021-03-11 19:05:22,013 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1132, PETRI_PLACES=129, PETRI_TRANSITIONS=133} [2021-03-11 19:05:22,013 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 69 predicate places. [2021-03-11 19:05:22,013 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 133 transitions, 1132 flow [2021-03-11 19:05:22,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,014 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:22,014 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:22,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 19:05:22,014 INFO L428 AbstractCegarLoop]: === Iteration 12 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1782467681, now seen corresponding path program 1 times [2021-03-11 19:05:22,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:22,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214413493] [2021-03-11 19:05:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:22,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:22,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:22,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-11 19:05:22,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:22,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:22,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214413493] [2021-03-11 19:05:22,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:22,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:05:22,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85077372] [2021-03-11 19:05:22,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:05:22,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:05:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:05:22,123 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 294 [2021-03-11 19:05:22,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 1132 flow. Second operand has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:22,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 294 [2021-03-11 19:05:22,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:22,813 INFO L129 PetriNetUnfolder]: 1160/2800 cut-off events. [2021-03-11 19:05:22,814 INFO L130 PetriNetUnfolder]: For 11294/11366 co-relation queries the response was YES. [2021-03-11 19:05:22,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11532 conditions, 2800 events. 1160/2800 cut-off events. For 11294/11366 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22444 event pairs, 39 based on Foata normal form. 82/2490 useless extension candidates. Maximal degree in co-relation 11232. Up to 468 conditions per place. [2021-03-11 19:05:22,832 INFO L132 encePairwiseOnDemand]: 272/294 looper letters, 157 selfloop transitions, 67 changer transitions 59/305 dead transitions. [2021-03-11 19:05:22,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 305 transitions, 3170 flow [2021-03-11 19:05:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-11 19:05:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-11 19:05:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2660 transitions. [2021-03-11 19:05:22,852 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6462585034013606 [2021-03-11 19:05:22,852 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2660 transitions. [2021-03-11 19:05:22,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2660 transitions. [2021-03-11 19:05:22,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:22,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2660 transitions. [2021-03-11 19:05:22,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 190.0) internal successors, (2660), 14 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 294.0) internal successors, (4410), 15 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,864 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 294.0) internal successors, (4410), 15 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,864 INFO L185 Difference]: Start difference. First operand has 129 places, 133 transitions, 1132 flow. Second operand 14 states and 2660 transitions. [2021-03-11 19:05:22,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 305 transitions, 3170 flow [2021-03-11 19:05:22,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 305 transitions, 2937 flow, removed 114 selfloop flow, removed 4 redundant places. [2021-03-11 19:05:22,925 INFO L241 Difference]: Finished difference. Result has 144 places, 160 transitions, 1575 flow [2021-03-11 19:05:22,926 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1575, PETRI_PLACES=144, PETRI_TRANSITIONS=160} [2021-03-11 19:05:22,926 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 84 predicate places. [2021-03-11 19:05:22,926 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 160 transitions, 1575 flow [2021-03-11 19:05:22,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:22,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:22,926 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:22,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 19:05:22,927 INFO L428 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1073873632, now seen corresponding path program 1 times [2021-03-11 19:05:22,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:22,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751861919] [2021-03-11 19:05:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:22,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:22,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:22,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:23,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:23,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:23,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:23,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:23,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751861919] [2021-03-11 19:05:23,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:23,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:05:23,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679767638] [2021-03-11 19:05:23,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:05:23,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:05:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:05:23,032 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 294 [2021-03-11 19:05:23,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 160 transitions, 1575 flow. Second operand has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:23,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 294 [2021-03-11 19:05:23,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:23,697 INFO L129 PetriNetUnfolder]: 996/2365 cut-off events. [2021-03-11 19:05:23,697 INFO L130 PetriNetUnfolder]: For 13208/13275 co-relation queries the response was YES. [2021-03-11 19:05:23,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11177 conditions, 2365 events. 996/2365 cut-off events. For 13208/13275 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17965 event pairs, 71 based on Foata normal form. 49/2022 useless extension candidates. Maximal degree in co-relation 10936. Up to 679 conditions per place. [2021-03-11 19:05:23,713 INFO L132 encePairwiseOnDemand]: 277/294 looper letters, 142 selfloop transitions, 66 changer transitions 43/273 dead transitions. [2021-03-11 19:05:23,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 273 transitions, 3184 flow [2021-03-11 19:05:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-11 19:05:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-11 19:05:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2971 transitions. [2021-03-11 19:05:23,720 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6315901360544217 [2021-03-11 19:05:23,720 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2971 transitions. [2021-03-11 19:05:23,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2971 transitions. [2021-03-11 19:05:23,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:23,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2971 transitions. [2021-03-11 19:05:23,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 185.6875) internal successors, (2971), 16 states have internal predecessors, (2971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,733 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,733 INFO L185 Difference]: Start difference. First operand has 144 places, 160 transitions, 1575 flow. Second operand 16 states and 2971 transitions. [2021-03-11 19:05:23,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 273 transitions, 3184 flow [2021-03-11 19:05:23,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 273 transitions, 3130 flow, removed 27 selfloop flow, removed 0 redundant places. [2021-03-11 19:05:23,803 INFO L241 Difference]: Finished difference. Result has 165 places, 169 transitions, 1903 flow [2021-03-11 19:05:23,803 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1903, PETRI_PLACES=165, PETRI_TRANSITIONS=169} [2021-03-11 19:05:23,804 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 105 predicate places. [2021-03-11 19:05:23,804 INFO L480 AbstractCegarLoop]: Abstraction has has 165 places, 169 transitions, 1903 flow [2021-03-11 19:05:23,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,804 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:23,804 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:23,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 19:05:23,805 INFO L428 AbstractCegarLoop]: === Iteration 14 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2004973951, now seen corresponding path program 1 times [2021-03-11 19:05:23,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:23,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029621321] [2021-03-11 19:05:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:23,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:23,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:23,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:23,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:23,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:23,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:23,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:23,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:23,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:23,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029621321] [2021-03-11 19:05:23,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:23,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:05:23,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396271787] [2021-03-11 19:05:23,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:05:23,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:05:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:05:23,892 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 294 [2021-03-11 19:05:23,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 169 transitions, 1903 flow. Second operand has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:23,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:23,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 294 [2021-03-11 19:05:23,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:24,503 INFO L129 PetriNetUnfolder]: 936/2381 cut-off events. [2021-03-11 19:05:24,503 INFO L130 PetriNetUnfolder]: For 16477/16560 co-relation queries the response was YES. [2021-03-11 19:05:24,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11600 conditions, 2381 events. 936/2381 cut-off events. For 16477/16560 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18754 event pairs, 89 based on Foata normal form. 51/2078 useless extension candidates. Maximal degree in co-relation 11401. Up to 630 conditions per place. [2021-03-11 19:05:24,521 INFO L132 encePairwiseOnDemand]: 277/294 looper letters, 161 selfloop transitions, 85 changer transitions 13/281 dead transitions. [2021-03-11 19:05:24,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 281 transitions, 3584 flow [2021-03-11 19:05:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-11 19:05:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-03-11 19:05:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2600 transitions. [2021-03-11 19:05:24,527 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6316812439261419 [2021-03-11 19:05:24,527 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2600 transitions. [2021-03-11 19:05:24,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2600 transitions. [2021-03-11 19:05:24,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:24,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2600 transitions. [2021-03-11 19:05:24,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 185.71428571428572) internal successors, (2600), 14 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:24,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 294.0) internal successors, (4410), 15 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:24,538 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 294.0) internal successors, (4410), 15 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:24,538 INFO L185 Difference]: Start difference. First operand has 165 places, 169 transitions, 1903 flow. Second operand 14 states and 2600 transitions. [2021-03-11 19:05:24,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 281 transitions, 3584 flow [2021-03-11 19:05:24,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 281 transitions, 3397 flow, removed 77 selfloop flow, removed 5 redundant places. [2021-03-11 19:05:24,626 INFO L241 Difference]: Finished difference. Result has 181 places, 208 transitions, 2691 flow [2021-03-11 19:05:24,626 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2691, PETRI_PLACES=181, PETRI_TRANSITIONS=208} [2021-03-11 19:05:24,626 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 121 predicate places. [2021-03-11 19:05:24,626 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 208 transitions, 2691 flow [2021-03-11 19:05:24,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:24,627 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:24,627 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:24,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 19:05:24,627 INFO L428 AbstractCegarLoop]: === Iteration 15 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1977783730, now seen corresponding path program 1 times [2021-03-11 19:05:24,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:24,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6641061] [2021-03-11 19:05:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:24,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:24,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:24,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:24,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:05:24,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:24,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:24,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:24,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:24,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:24,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-03-11 19:05:24,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6641061] [2021-03-11 19:05:24,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:24,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:05:24,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878288268] [2021-03-11 19:05:24,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:05:24,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:05:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:05:24,724 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 294 [2021-03-11 19:05:24,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 208 transitions, 2691 flow. Second operand has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:24,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:24,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 294 [2021-03-11 19:05:24,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:25,426 INFO L129 PetriNetUnfolder]: 878/2260 cut-off events. [2021-03-11 19:05:25,427 INFO L130 PetriNetUnfolder]: For 19396/19501 co-relation queries the response was YES. [2021-03-11 19:05:25,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11943 conditions, 2260 events. 878/2260 cut-off events. For 19396/19501 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17602 event pairs, 59 based on Foata normal form. 59/1965 useless extension candidates. Maximal degree in co-relation 11868. Up to 564 conditions per place. [2021-03-11 19:05:25,442 INFO L132 encePairwiseOnDemand]: 277/294 looper letters, 152 selfloop transitions, 88 changer transitions 38/300 dead transitions. [2021-03-11 19:05:25,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 300 transitions, 4187 flow [2021-03-11 19:05:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-11 19:05:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-11 19:05:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2964 transitions. [2021-03-11 19:05:25,446 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6301020408163265 [2021-03-11 19:05:25,446 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2964 transitions. [2021-03-11 19:05:25,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2964 transitions. [2021-03-11 19:05:25,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:25,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2964 transitions. [2021-03-11 19:05:25,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 185.25) internal successors, (2964), 16 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:25,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:25,457 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:25,457 INFO L185 Difference]: Start difference. First operand has 181 places, 208 transitions, 2691 flow. Second operand 16 states and 2964 transitions. [2021-03-11 19:05:25,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 300 transitions, 4187 flow [2021-03-11 19:05:25,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 300 transitions, 4086 flow, removed 48 selfloop flow, removed 2 redundant places. [2021-03-11 19:05:25,575 INFO L241 Difference]: Finished difference. Result has 198 places, 199 transitions, 2689 flow [2021-03-11 19:05:25,575 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2606, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2689, PETRI_PLACES=198, PETRI_TRANSITIONS=199} [2021-03-11 19:05:25,575 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 138 predicate places. [2021-03-11 19:05:25,576 INFO L480 AbstractCegarLoop]: Abstraction has has 198 places, 199 transitions, 2689 flow [2021-03-11 19:05:25,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 176.66666666666666) internal successors, (1590), 9 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:25,576 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:25,576 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:25,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 19:05:25,577 INFO L428 AbstractCegarLoop]: === Iteration 16 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash -87440581, now seen corresponding path program 1 times [2021-03-11 19:05:25,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:25,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000025638] [2021-03-11 19:05:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:25,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:25,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:25,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:25,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:25,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:25,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:25,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:25,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:25,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000025638] [2021-03-11 19:05:25,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:25,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:05:25,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134923062] [2021-03-11 19:05:25,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 19:05:25,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 19:05:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-11 19:05:25,648 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2021-03-11 19:05:25,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 199 transitions, 2689 flow. Second operand has 8 states, 8 states have (on average 210.75) internal successors, (1686), 8 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:25,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:25,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2021-03-11 19:05:25,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:26,020 INFO L129 PetriNetUnfolder]: 564/1698 cut-off events. [2021-03-11 19:05:26,020 INFO L130 PetriNetUnfolder]: For 15840/15985 co-relation queries the response was YES. [2021-03-11 19:05:26,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 1698 events. 564/1698 cut-off events. For 15840/15985 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13393 event pairs, 49 based on Foata normal form. 31/1513 useless extension candidates. Maximal degree in co-relation 8712. Up to 303 conditions per place. [2021-03-11 19:05:26,032 INFO L132 encePairwiseOnDemand]: 282/294 looper letters, 86 selfloop transitions, 41 changer transitions 84/283 dead transitions. [2021-03-11 19:05:26,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 283 transitions, 4040 flow [2021-03-11 19:05:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 19:05:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 19:05:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2397 transitions. [2021-03-11 19:05:26,036 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7411873840445269 [2021-03-11 19:05:26,036 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2397 transitions. [2021-03-11 19:05:26,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2397 transitions. [2021-03-11 19:05:26,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:26,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2397 transitions. [2021-03-11 19:05:26,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 217.9090909090909) internal successors, (2397), 11 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 294.0) internal successors, (3528), 12 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,043 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 294.0) internal successors, (3528), 12 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,043 INFO L185 Difference]: Start difference. First operand has 198 places, 199 transitions, 2689 flow. Second operand 11 states and 2397 transitions. [2021-03-11 19:05:26,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 283 transitions, 4040 flow [2021-03-11 19:05:26,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 283 transitions, 3713 flow, removed 72 selfloop flow, removed 17 redundant places. [2021-03-11 19:05:26,147 INFO L241 Difference]: Finished difference. Result has 195 places, 171 transitions, 2219 flow [2021-03-11 19:05:26,147 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2219, PETRI_PLACES=195, PETRI_TRANSITIONS=171} [2021-03-11 19:05:26,147 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 135 predicate places. [2021-03-11 19:05:26,147 INFO L480 AbstractCegarLoop]: Abstraction has has 195 places, 171 transitions, 2219 flow [2021-03-11 19:05:26,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 210.75) internal successors, (1686), 8 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,148 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:26,148 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:26,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 19:05:26,149 INFO L428 AbstractCegarLoop]: === Iteration 17 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1009009014, now seen corresponding path program 1 times [2021-03-11 19:05:26,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:26,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956969683] [2021-03-11 19:05:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:26,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:26,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:26,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956969683] [2021-03-11 19:05:26,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:26,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:05:26,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766684012] [2021-03-11 19:05:26,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:05:26,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:05:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:05:26,221 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 294 [2021-03-11 19:05:26,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 171 transitions, 2219 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:26,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 294 [2021-03-11 19:05:26,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:26,515 INFO L129 PetriNetUnfolder]: 439/1313 cut-off events. [2021-03-11 19:05:26,515 INFO L130 PetriNetUnfolder]: For 11588/11628 co-relation queries the response was YES. [2021-03-11 19:05:26,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7015 conditions, 1313 events. 439/1313 cut-off events. For 11588/11628 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9737 event pairs, 25 based on Foata normal form. 18/1178 useless extension candidates. Maximal degree in co-relation 6949. Up to 246 conditions per place. [2021-03-11 19:05:26,527 INFO L132 encePairwiseOnDemand]: 284/294 looper letters, 77 selfloop transitions, 34 changer transitions 85/238 dead transitions. [2021-03-11 19:05:26,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 238 transitions, 3372 flow [2021-03-11 19:05:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 19:05:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 19:05:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1949 transitions. [2021-03-11 19:05:26,530 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.736583522297808 [2021-03-11 19:05:26,530 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1949 transitions. [2021-03-11 19:05:26,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1949 transitions. [2021-03-11 19:05:26,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:26,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1949 transitions. [2021-03-11 19:05:26,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 216.55555555555554) internal successors, (1949), 9 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,537 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,537 INFO L185 Difference]: Start difference. First operand has 195 places, 171 transitions, 2219 flow. Second operand 9 states and 1949 transitions. [2021-03-11 19:05:26,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 238 transitions, 3372 flow [2021-03-11 19:05:26,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 238 transitions, 2972 flow, removed 42 selfloop flow, removed 24 redundant places. [2021-03-11 19:05:26,603 INFO L241 Difference]: Finished difference. Result has 178 places, 123 transitions, 1405 flow [2021-03-11 19:05:26,603 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1405, PETRI_PLACES=178, PETRI_TRANSITIONS=123} [2021-03-11 19:05:26,604 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 118 predicate places. [2021-03-11 19:05:26,604 INFO L480 AbstractCegarLoop]: Abstraction has has 178 places, 123 transitions, 1405 flow [2021-03-11 19:05:26,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,605 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:26,605 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:26,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 19:05:26,605 INFO L428 AbstractCegarLoop]: === Iteration 18 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 416643489, now seen corresponding path program 1 times [2021-03-11 19:05:26,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:26,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070219031] [2021-03-11 19:05:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:26,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:26,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:26,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:26,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:26,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070219031] [2021-03-11 19:05:26,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:26,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:05:26,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484993284] [2021-03-11 19:05:26,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:05:26,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:05:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:05:26,675 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 294 [2021-03-11 19:05:26,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 123 transitions, 1405 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:26,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 294 [2021-03-11 19:05:26,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:26,960 INFO L129 PetriNetUnfolder]: 353/1027 cut-off events. [2021-03-11 19:05:26,960 INFO L130 PetriNetUnfolder]: For 6941/6985 co-relation queries the response was YES. [2021-03-11 19:05:26,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5167 conditions, 1027 events. 353/1027 cut-off events. For 6941/6985 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6795 event pairs, 59 based on Foata normal form. 32/926 useless extension candidates. Maximal degree in co-relation 5108. Up to 185 conditions per place. [2021-03-11 19:05:26,969 INFO L132 encePairwiseOnDemand]: 285/294 looper letters, 70 selfloop transitions, 37 changer transitions 39/188 dead transitions. [2021-03-11 19:05:26,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 188 transitions, 2571 flow [2021-03-11 19:05:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 19:05:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 19:05:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2363 transitions. [2021-03-11 19:05:26,971 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.730674087816945 [2021-03-11 19:05:26,971 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2363 transitions. [2021-03-11 19:05:26,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2363 transitions. [2021-03-11 19:05:26,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:26,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2363 transitions. [2021-03-11 19:05:26,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 214.8181818181818) internal successors, (2363), 11 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-03-11 19:05:26,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 294.0) internal successors, (3528), 12 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,978 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 294.0) internal successors, (3528), 12 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:26,978 INFO L185 Difference]: Start difference. First operand has 178 places, 123 transitions, 1405 flow. Second operand 11 states and 2363 transitions. [2021-03-11 19:05:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 188 transitions, 2571 flow [2021-03-11 19:05:27,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 188 transitions, 2132 flow, removed 49 selfloop flow, removed 32 redundant places. [2021-03-11 19:05:27,009 INFO L241 Difference]: Finished difference. Result has 151 places, 128 transitions, 1256 flow [2021-03-11 19:05:27,009 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1256, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2021-03-11 19:05:27,010 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 91 predicate places. [2021-03-11 19:05:27,010 INFO L480 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 1256 flow [2021-03-11 19:05:27,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,010 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:27,010 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:27,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 19:05:27,011 INFO L428 AbstractCegarLoop]: === Iteration 19 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash -829571193, now seen corresponding path program 2 times [2021-03-11 19:05:27,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:27,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781817013] [2021-03-11 19:05:27,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:27,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:27,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781817013] [2021-03-11 19:05:27,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:27,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:05:27,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396157659] [2021-03-11 19:05:27,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:05:27,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:05:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:05:27,054 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 294 [2021-03-11 19:05:27,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 1256 flow. Second operand has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:27,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 294 [2021-03-11 19:05:27,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:27,154 INFO L129 PetriNetUnfolder]: 213/684 cut-off events. [2021-03-11 19:05:27,154 INFO L130 PetriNetUnfolder]: For 3361/3386 co-relation queries the response was YES. [2021-03-11 19:05:27,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 684 events. 213/684 cut-off events. For 3361/3386 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4267 event pairs, 26 based on Foata normal form. 21/602 useless extension candidates. Maximal degree in co-relation 3244. Up to 125 conditions per place. [2021-03-11 19:05:27,158 INFO L132 encePairwiseOnDemand]: 290/294 looper letters, 31 selfloop transitions, 3 changer transitions 52/134 dead transitions. [2021-03-11 19:05:27,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 134 transitions, 1482 flow [2021-03-11 19:05:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:05:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:05:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 964 transitions. [2021-03-11 19:05:27,159 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8197278911564626 [2021-03-11 19:05:27,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 964 transitions. [2021-03-11 19:05:27,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 964 transitions. [2021-03-11 19:05:27,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:27,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 964 transitions. [2021-03-11 19:05:27,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,162 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,162 INFO L185 Difference]: Start difference. First operand has 151 places, 128 transitions, 1256 flow. Second operand 4 states and 964 transitions. [2021-03-11 19:05:27,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 134 transitions, 1482 flow [2021-03-11 19:05:27,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 1371 flow, removed 31 selfloop flow, removed 10 redundant places. [2021-03-11 19:05:27,182 INFO L241 Difference]: Finished difference. Result has 141 places, 79 transitions, 665 flow [2021-03-11 19:05:27,182 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=665, PETRI_PLACES=141, PETRI_TRANSITIONS=79} [2021-03-11 19:05:27,182 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 81 predicate places. [2021-03-11 19:05:27,183 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 79 transitions, 665 flow [2021-03-11 19:05:27,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 237.5) internal successors, (950), 4 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,183 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:27,183 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:27,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 19:05:27,183 INFO L428 AbstractCegarLoop]: === Iteration 20 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1164872628, now seen corresponding path program 1 times [2021-03-11 19:05:27,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:27,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471205054] [2021-03-11 19:05:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:27,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:27,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471205054] [2021-03-11 19:05:27,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:27,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:05:27,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728686218] [2021-03-11 19:05:27,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:05:27,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:05:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:05:27,243 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2021-03-11 19:05:27,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 79 transitions, 665 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:27,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2021-03-11 19:05:27,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:27,415 INFO L129 PetriNetUnfolder]: 165/439 cut-off events. [2021-03-11 19:05:27,415 INFO L130 PetriNetUnfolder]: For 2171/2185 co-relation queries the response was YES. [2021-03-11 19:05:27,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 439 events. 165/439 cut-off events. For 2171/2185 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1913 event pairs, 41 based on Foata normal form. 9/369 useless extension candidates. Maximal degree in co-relation 2067. Up to 113 conditions per place. [2021-03-11 19:05:27,418 INFO L132 encePairwiseOnDemand]: 283/294 looper letters, 44 selfloop transitions, 22 changer transitions 19/115 dead transitions. [2021-03-11 19:05:27,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 115 transitions, 1215 flow [2021-03-11 19:05:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 19:05:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 19:05:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1938 transitions. [2021-03-11 19:05:27,422 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7324263038548753 [2021-03-11 19:05:27,422 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1938 transitions. [2021-03-11 19:05:27,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1938 transitions. [2021-03-11 19:05:27,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:27,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1938 transitions. [2021-03-11 19:05:27,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.33333333333334) internal successors, (1938), 9 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,427 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,427 INFO L185 Difference]: Start difference. First operand has 141 places, 79 transitions, 665 flow. Second operand 9 states and 1938 transitions. [2021-03-11 19:05:27,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 115 transitions, 1215 flow [2021-03-11 19:05:27,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 115 transitions, 998 flow, removed 23 selfloop flow, removed 29 redundant places. [2021-03-11 19:05:27,438 INFO L241 Difference]: Finished difference. Result has 110 places, 82 transitions, 610 flow [2021-03-11 19:05:27,438 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2021-03-11 19:05:27,438 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 50 predicate places. [2021-03-11 19:05:27,438 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 610 flow [2021-03-11 19:05:27,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,439 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:27,439 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:27,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 19:05:27,439 INFO L428 AbstractCegarLoop]: === Iteration 21 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1098646630, now seen corresponding path program 2 times [2021-03-11 19:05:27,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:27,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235782643] [2021-03-11 19:05:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:27,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:27,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235782643] [2021-03-11 19:05:27,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:27,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:05:27,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925301772] [2021-03-11 19:05:27,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:05:27,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:05:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:05:27,476 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 294 [2021-03-11 19:05:27,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:27,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 294 [2021-03-11 19:05:27,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:27,542 INFO L129 PetriNetUnfolder]: 119/395 cut-off events. [2021-03-11 19:05:27,542 INFO L130 PetriNetUnfolder]: For 1093/1109 co-relation queries the response was YES. [2021-03-11 19:05:27,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 395 events. 119/395 cut-off events. For 1093/1109 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1970 event pairs, 17 based on Foata normal form. 8/347 useless extension candidates. Maximal degree in co-relation 1517. Up to 83 conditions per place. [2021-03-11 19:05:27,545 INFO L132 encePairwiseOnDemand]: 289/294 looper letters, 41 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2021-03-11 19:05:27,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 95 transitions, 895 flow [2021-03-11 19:05:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:05:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:05:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 976 transitions. [2021-03-11 19:05:27,548 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2021-03-11 19:05:27,548 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 976 transitions. [2021-03-11 19:05:27,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 976 transitions. [2021-03-11 19:05:27,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:27,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 976 transitions. [2021-03-11 19:05:27,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,551 INFO L185 Difference]: Start difference. First operand has 110 places, 82 transitions, 610 flow. Second operand 4 states and 976 transitions. [2021-03-11 19:05:27,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 95 transitions, 895 flow [2021-03-11 19:05:27,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 811 flow, removed 23 selfloop flow, removed 6 redundant places. [2021-03-11 19:05:27,558 INFO L241 Difference]: Finished difference. Result has 109 places, 85 transitions, 642 flow [2021-03-11 19:05:27,558 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=109, PETRI_TRANSITIONS=85} [2021-03-11 19:05:27,558 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 49 predicate places. [2021-03-11 19:05:27,558 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 85 transitions, 642 flow [2021-03-11 19:05:27,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 239.5) internal successors, (958), 4 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,558 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:27,558 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:27,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 19:05:27,559 INFO L428 AbstractCegarLoop]: === Iteration 22 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1131464626, now seen corresponding path program 3 times [2021-03-11 19:05:27,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:27,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326367333] [2021-03-11 19:05:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:27,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:27,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326367333] [2021-03-11 19:05:27,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:27,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:05:27,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049248630] [2021-03-11 19:05:27,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:05:27,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:05:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:05:27,654 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2021-03-11 19:05:27,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 85 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:27,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2021-03-11 19:05:27,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:27,844 INFO L129 PetriNetUnfolder]: 186/543 cut-off events. [2021-03-11 19:05:27,844 INFO L130 PetriNetUnfolder]: For 1436/1453 co-relation queries the response was YES. [2021-03-11 19:05:27,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 543 events. 186/543 cut-off events. For 1436/1453 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2759 event pairs, 44 based on Foata normal form. 11/465 useless extension candidates. Maximal degree in co-relation 2165. Up to 113 conditions per place. [2021-03-11 19:05:27,848 INFO L132 encePairwiseOnDemand]: 283/294 looper letters, 36 selfloop transitions, 24 changer transitions 36/126 dead transitions. [2021-03-11 19:05:27,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 126 transitions, 1344 flow [2021-03-11 19:05:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 19:05:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 19:05:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2148 transitions. [2021-03-11 19:05:27,850 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7306122448979592 [2021-03-11 19:05:27,850 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2148 transitions. [2021-03-11 19:05:27,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2148 transitions. [2021-03-11 19:05:27,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:27,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2148 transitions. [2021-03-11 19:05:27,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 214.8) internal successors, (2148), 10 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,856 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,856 INFO L185 Difference]: Start difference. First operand has 109 places, 85 transitions, 642 flow. Second operand 10 states and 2148 transitions. [2021-03-11 19:05:27,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 126 transitions, 1344 flow [2021-03-11 19:05:27,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 126 transitions, 1262 flow, removed 38 selfloop flow, removed 1 redundant places. [2021-03-11 19:05:27,865 INFO L241 Difference]: Finished difference. Result has 121 places, 81 transitions, 663 flow [2021-03-11 19:05:27,865 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=663, PETRI_PLACES=121, PETRI_TRANSITIONS=81} [2021-03-11 19:05:27,865 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 61 predicate places. [2021-03-11 19:05:27,865 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 81 transitions, 663 flow [2021-03-11 19:05:27,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:05:27,866 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:05:27,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 19:05:27,866 INFO L428 AbstractCegarLoop]: === Iteration 23 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-11 19:05:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:05:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash 962725487, now seen corresponding path program 2 times [2021-03-11 19:05:27,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:05:27,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673453378] [2021-03-11 19:05:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:05:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:05:27,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:05:27,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:05:27,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:05:27,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:05:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:05:27,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673453378] [2021-03-11 19:05:27,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:05:27,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:05:27,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565514351] [2021-03-11 19:05:27,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 19:05:27,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:05:27,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 19:05:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 19:05:27,932 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2021-03-11 19:05:27,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 81 transitions, 663 flow. Second operand has 8 states, 8 states have (on average 210.75) internal successors, (1686), 8 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:27,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:05:27,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2021-03-11 19:05:27,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:05:28,027 INFO L129 PetriNetUnfolder]: 110/284 cut-off events. [2021-03-11 19:05:28,027 INFO L130 PetriNetUnfolder]: For 944/945 co-relation queries the response was YES. [2021-03-11 19:05:28,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 284 events. 110/284 cut-off events. For 944/945 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 990 event pairs, 25 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 1253. Up to 86 conditions per place. [2021-03-11 19:05:28,028 INFO L132 encePairwiseOnDemand]: 284/294 looper letters, 0 selfloop transitions, 0 changer transitions 94/94 dead transitions. [2021-03-11 19:05:28,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 94 transitions, 940 flow [2021-03-11 19:05:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:05:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:05:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1708 transitions. [2021-03-11 19:05:28,030 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2021-03-11 19:05:28,030 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1708 transitions. [2021-03-11 19:05:28,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1708 transitions. [2021-03-11 19:05:28,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:05:28,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1708 transitions. [2021-03-11 19:05:28,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 213.5) internal successors, (1708), 8 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:28,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:28,034 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:28,034 INFO L185 Difference]: Start difference. First operand has 121 places, 81 transitions, 663 flow. Second operand 8 states and 1708 transitions. [2021-03-11 19:05:28,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 94 transitions, 940 flow [2021-03-11 19:05:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 94 transitions, 854 flow, removed 11 selfloop flow, removed 13 redundant places. [2021-03-11 19:05:28,041 INFO L241 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2021-03-11 19:05:28,041 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2021-03-11 19:05:28,041 INFO L335 CegarLoopForPetriNet]: 60 programPoint places, 50 predicate places. [2021-03-11 19:05:28,041 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2021-03-11 19:05:28,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 210.75) internal successors, (1686), 8 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:05:28,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 19:05:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 07:05:28 BasicIcfg [2021-03-11 19:05:28,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 19:05:28,045 INFO L168 Benchmark]: Toolchain (without parser) took 21436.44 ms. Allocated memory was 255.9 MB in the beginning and 1.0 GB in the end (delta: 792.7 MB). Free memory was 232.6 MB in the beginning and 574.3 MB in the end (delta: -341.7 MB). Peak memory consumption was 450.8 MB. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.55 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 232.2 MB in the beginning and 327.4 MB in the end (delta: -95.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 367.0 MB. Free memory was 327.4 MB in the beginning and 324.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 367.0 MB. Free memory was 324.7 MB in the beginning and 323.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: RCFGBuilder took 944.15 ms. Allocated memory is still 367.0 MB. Free memory was 323.1 MB in the beginning and 280.7 MB in the end (delta: 42.4 MB). Peak memory consumption was 44.9 MB. Max. memory is 16.0 GB. [2021-03-11 19:05:28,046 INFO L168 Benchmark]: TraceAbstraction took 19907.83 ms. Allocated memory was 367.0 MB in the beginning and 1.0 GB in the end (delta: 681.6 MB). Free memory was 280.7 MB in the beginning and 574.3 MB in the end (delta: -293.6 MB). Peak memory consumption was 388.6 MB. Max. memory is 16.0 GB. [2021-03-11 19:05:28,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 507.55 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 232.2 MB in the beginning and 327.4 MB in the end (delta: -95.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.36 ms. Allocated memory is still 367.0 MB. Free memory was 327.4 MB in the beginning and 324.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 367.0 MB. Free memory was 324.7 MB in the beginning and 323.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 944.15 ms. Allocated memory is still 367.0 MB. Free memory was 323.1 MB in the beginning and 280.7 MB in the end (delta: 42.4 MB). Peak memory consumption was 44.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19907.83 ms. Allocated memory was 367.0 MB in the beginning and 1.0 GB in the end (delta: 681.6 MB). Free memory was 280.7 MB in the beginning and 574.3 MB in the end (delta: -293.6 MB). Peak memory consumption was 388.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6784.0ms, 147 PlacesBefore, 60 PlacesAfterwards, 159 TransitionsBefore, 68 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 6 FixpointIterations, 24 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 26305 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15489, positive: 15157, positive conditional: 0, positive unconditional: 15157, negative: 332, negative conditional: 0, negative unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6999, positive: 6886, positive conditional: 0, positive unconditional: 6886, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6999, positive: 6843, positive conditional: 0, positive unconditional: 6843, negative: 156, negative conditional: 0, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 156, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 769, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 598, negative conditional: 0, negative unconditional: 598, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15489, positive: 8271, positive conditional: 0, positive unconditional: 8271, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 6999, unknown conditional: 0, unknown unconditional: 6999] , Statistics on independence cache: Total cache size (in pairs): 1060, Positive cache size: 1014, Positive conditional cache size: 0, Positive unconditional cache size: 1014, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 19702.5ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10866.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6913.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 395 SDtfs, 1023 SDslu, 603 SDs, 0 SdLazy, 3817 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2150.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1487.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2691occurred in iteration=14, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.3ms SsaConstructionTime, 344.7ms SatisfiabilityAnalysisTime, 1232.5ms InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...