/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 08:38:13,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 08:38:13,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 08:38:13,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 08:38:13,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 08:38:13,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 08:38:13,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 08:38:13,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 08:38:13,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 08:38:13,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 08:38:13,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 08:38:13,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 08:38:13,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 08:38:13,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 08:38:13,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 08:38:13,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 08:38:13,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 08:38:13,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 08:38:13,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 08:38:13,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 08:38:13,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 08:38:13,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 08:38:13,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 08:38:13,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 08:38:13,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 08:38:13,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 08:38:13,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 08:38:13,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 08:38:13,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 08:38:13,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 08:38:13,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 08:38:13,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 08:38:13,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 08:38:13,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 08:38:13,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 08:38:13,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 08:38:13,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 08:38:13,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 08:38:13,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 08:38:13,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 08:38:13,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 08:38:13,244 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 08:38:13,278 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 08:38:13,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 08:38:13,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 08:38:13,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 08:38:13,281 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 08:38:13,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 08:38:13,282 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 08:38:13,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 08:38:13,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 08:38:13,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 08:38:13,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 08:38:13,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 08:38:13,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 08:38:13,284 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 08:38:13,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 08:38:13,284 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 08:38:13,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 08:38:13,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 08:38:13,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 08:38:13,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 08:38:13,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 08:38:13,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 08:38:13,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 08:38:13,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 08:38:13,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 08:38:13,287 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 08:38:13,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 08:38:13,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 08:38:13,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 08:38:13,609 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 08:38:13,610 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 08:38:13,611 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-26 08:38:13,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08102c87e/ac7f71188845488dabb907eae4d0ae80/FLAG002915c1f [2021-03-26 08:38:14,131 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 08:38:14,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-26 08:38:14,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08102c87e/ac7f71188845488dabb907eae4d0ae80/FLAG002915c1f [2021-03-26 08:38:14,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08102c87e/ac7f71188845488dabb907eae4d0ae80 [2021-03-26 08:38:14,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 08:38:14,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 08:38:14,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 08:38:14,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 08:38:14,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 08:38:14,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc7e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14, skipping insertion in model container [2021-03-26 08:38:14,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 08:38:14,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 08:38:14,551 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-26 08:38:14,556 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-26 08:38:14,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 08:38:14,584 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 08:38:14,620 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-26 08:38:14,621 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-26 08:38:14,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 08:38:14,709 INFO L208 MainTranslator]: Completed translation [2021-03-26 08:38:14,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14 WrapperNode [2021-03-26 08:38:14,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 08:38:14,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 08:38:14,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 08:38:14,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 08:38:14,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 08:38:14,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 08:38:14,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 08:38:14,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 08:38:14,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (1/1) ... [2021-03-26 08:38:14,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 08:38:14,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 08:38:14,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 08:38:14,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 08:38:14,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (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-26 08:38:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-03-26 08:38:14,890 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-03-26 08:38:14,890 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-03-26 08:38:14,891 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-03-26 08:38:14,891 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 08:38:14,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 08:38:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 08:38:14,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 08:38:14,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 08:38:14,893 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 08:38:15,913 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 08:38:15,913 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 08:38:15,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 08:38:15 BoogieIcfgContainer [2021-03-26 08:38:15,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 08:38:15,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 08:38:15,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 08:38:15,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 08:38:15,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 08:38:14" (1/3) ... [2021-03-26 08:38:15,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60a17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 08:38:15, skipping insertion in model container [2021-03-26 08:38:15,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:38:14" (2/3) ... [2021-03-26 08:38:15,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60a17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 08:38:15, skipping insertion in model container [2021-03-26 08:38:15,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 08:38:15" (3/3) ... [2021-03-26 08:38:15,921 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-03-26 08:38:15,926 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 08:38:15,929 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 08:38:15,930 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 08:38:15,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,988 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,989 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-26 08:38:15,989 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,990 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-26 08:38:15,990 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-26 08:38:15,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,990 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-26 08:38:15,990 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,990 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-26 08:38:15,990 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-26 08:38:15,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 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-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 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-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,995 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-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,996 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-26 08:38:15,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,997 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,998 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,999 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-26 08:38:15,999 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,999 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-26 08:38:15,999 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-26 08:38:15,999 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:15,999 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-26 08:38:16,000 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,000 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-26 08:38:16,000 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-26 08:38:16,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 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-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,002 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 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-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,003 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 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-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,004 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,005 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,005 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,005 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,005 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-26 08:38:16,005 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,008 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 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-26 08:38:16,009 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,010 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-26 08:38:16,011 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-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,016 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,017 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,017 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,017 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-26 08:38:16,017 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,017 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,017 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-26 08:38:16,017 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-26 08:38:16,017 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,018 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-26 08:38:16,018 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,018 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,018 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-26 08:38:16,018 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-26 08:38:16,018 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-26 08:38:16,018 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,018 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,018 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-26 08:38:16,018 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 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-26 08:38:16,019 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-26 08:38:16,019 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-26 08:38:16,019 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 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-26 08:38:16,019 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,019 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-26 08:38:16,019 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-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,020 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,021 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,022 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 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-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,023 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-26 08:38:16,023 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-26 08:38:16,023 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 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-26 08:38:16,024 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 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-26 08:38:16,024 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-26 08:38:16,024 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-26 08:38:16,024 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,024 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-26 08:38:16,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,025 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-26 08:38:16,025 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-26 08:38:16,025 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-26 08:38:16,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,025 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,025 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-26 08:38:16,025 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,025 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-26 08:38:16,025 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-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,026 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,027 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,028 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,029 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,031 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,031 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-26 08:38:16,031 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-26 08:38:16,031 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,031 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 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-26 08:38:16,032 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,032 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-26 08:38:16,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,033 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,033 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,033 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,037 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-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 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-26 08:38:16,038 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-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,038 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,039 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,039 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-26 08:38:16,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,040 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-26 08:38:16,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,040 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-26 08:38:16,040 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-26 08:38:16,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,040 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,040 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 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-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 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-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,041 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 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-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 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-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 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-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 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-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,042 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-26 08:38:16,043 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,043 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-26 08:38:16,043 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-26 08:38:16,043 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-26 08:38:16,043 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,043 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:38:16,049 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-26 08:38:16,064 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 08:38:16,080 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 08:38:16,080 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 08:38:16,080 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 08:38:16,080 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 08:38:16,080 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 08:38:16,080 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 08:38:16,081 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 08:38:16,081 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 08:38:16,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-03-26 08:38:16,135 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-03-26 08:38:16,135 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 08:38:16,140 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-26 08:38:16,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-03-26 08:38:16,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-03-26 08:38:16,146 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:16,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-26 08:38:16,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-26 08:38:16,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-03-26 08:38:16,185 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-03-26 08:38:16,185 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 08:38:16,187 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-26 08:38:16,193 INFO L142 LiptonReduction]: Number of co-enabled transitions 10120 [2021-03-26 08:38:20,459 INFO L154 LiptonReduction]: Checked pairs total: 12308 [2021-03-26 08:38:20,460 INFO L156 LiptonReduction]: Total number of compositions: 85 [2021-03-26 08:38:20,461 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4316 [2021-03-26 08:38:20,473 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2021-03-26 08:38:20,473 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 08:38:20,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:20,474 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:20,474 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-26 08:38:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 392022303, now seen corresponding path program 1 times [2021-03-26 08:38:20,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:20,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544728900] [2021-03-26 08:38:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:20,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:20,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:20,658 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:20,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:20,668 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:20,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:20,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:20,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:20,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:20,681 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-26 08:38:20,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544728900] [2021-03-26 08:38:20,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:20,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:38:20,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594644356] [2021-03-26 08:38:20,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:38:20,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:38:20,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:38:20,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 260 [2021-03-26 08:38:20,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 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-26 08:38:20,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:20,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 260 [2021-03-26 08:38:20,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:20,992 INFO L129 PetriNetUnfolder]: 467/1088 cut-off events. [2021-03-26 08:38:20,992 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2021-03-26 08:38:20,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1088 events. 467/1088 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6966 event pairs, 137 based on Foata normal form. 135/1095 useless extension candidates. Maximal degree in co-relation 1760. Up to 523 conditions per place. [2021-03-26 08:38:21,006 INFO L132 encePairwiseOnDemand]: 242/260 looper letters, 45 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2021-03-26 08:38:21,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 388 flow [2021-03-26 08:38:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:38:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:38:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2021-03-26 08:38:21,023 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7461538461538462 [2021-03-26 08:38:21,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1164 transitions. [2021-03-26 08:38:21,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1164 transitions. [2021-03-26 08:38:21,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:21,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1164 transitions. [2021-03-26 08:38:21,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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-26 08:38:21,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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-26 08:38:21,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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-26 08:38:21,044 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 199 flow. Second operand 6 states and 1164 transitions. [2021-03-26 08:38:21,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 388 flow [2021-03-26 08:38:21,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 368 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-26 08:38:21,053 INFO L241 Difference]: Finished difference. Result has 82 places, 104 transitions, 339 flow [2021-03-26 08:38:21,055 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2021-03-26 08:38:21,055 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2021-03-26 08:38:21,055 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:21,055 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-26 08:38:21,057 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-26 08:38:21,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 104 transitions, 339 flow [2021-03-26 08:38:21,090 INFO L129 PetriNetUnfolder]: 100/433 cut-off events. [2021-03-26 08:38:21,090 INFO L130 PetriNetUnfolder]: For 105/116 co-relation queries the response was YES. [2021-03-26 08:38:21,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 433 events. 100/433 cut-off events. For 105/116 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2768 event pairs, 1 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 505. Up to 42 conditions per place. [2021-03-26 08:38:21,098 INFO L142 LiptonReduction]: Number of co-enabled transitions 4322 [2021-03-26 08:38:22,237 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-26 08:38:22,804 INFO L154 LiptonReduction]: Checked pairs total: 8618 [2021-03-26 08:38:22,804 INFO L156 LiptonReduction]: Total number of compositions: 20 [2021-03-26 08:38:22,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1749 [2021-03-26 08:38:22,806 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 321 flow [2021-03-26 08:38:22,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 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-26 08:38:22,806 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:22,806 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:22,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 08:38:22,807 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-26 08:38:22,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash -727867361, now seen corresponding path program 1 times [2021-03-26 08:38:22,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:22,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444753454] [2021-03-26 08:38:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:22,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:22,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:22,917 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-26 08:38:22,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444753454] [2021-03-26 08:38:22,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:22,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:38:22,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623899520] [2021-03-26 08:38:22,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:22,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:22,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:22,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 280 [2021-03-26 08:38:22,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 95 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 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-26 08:38:22,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:22,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 280 [2021-03-26 08:38:22,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:22,973 INFO L129 PetriNetUnfolder]: 113/447 cut-off events. [2021-03-26 08:38:22,973 INFO L130 PetriNetUnfolder]: For 105/112 co-relation queries the response was YES. [2021-03-26 08:38:22,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 447 events. 113/447 cut-off events. For 105/112 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2835 event pairs, 6 based on Foata normal form. 8/414 useless extension candidates. Maximal degree in co-relation 544. Up to 48 conditions per place. [2021-03-26 08:38:22,977 INFO L132 encePairwiseOnDemand]: 277/280 looper letters, 6 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2021-03-26 08:38:22,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 341 flow [2021-03-26 08:38:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2021-03-26 08:38:22,979 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.925 [2021-03-26 08:38:22,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2021-03-26 08:38:22,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2021-03-26 08:38:22,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:22,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2021-03-26 08:38:22,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-26 08:38:22,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 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-26 08:38:22,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 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-26 08:38:22,984 INFO L185 Difference]: Start difference. First operand has 73 places, 95 transitions, 321 flow. Second operand 3 states and 777 transitions. [2021-03-26 08:38:22,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 341 flow [2021-03-26 08:38:22,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:22,988 INFO L241 Difference]: Finished difference. Result has 76 places, 95 transitions, 329 flow [2021-03-26 08:38:22,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2021-03-26 08:38:22,989 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2021-03-26 08:38:22,989 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:22,989 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-26 08:38:22,989 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-26 08:38:22,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 95 transitions, 329 flow [2021-03-26 08:38:23,018 INFO L129 PetriNetUnfolder]: 102/409 cut-off events. [2021-03-26 08:38:23,018 INFO L130 PetriNetUnfolder]: For 110/121 co-relation queries the response was YES. [2021-03-26 08:38:23,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 409 events. 102/409 cut-off events. For 110/121 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2607 event pairs, 1 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 516. Up to 42 conditions per place. [2021-03-26 08:38:23,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 3716 [2021-03-26 08:38:23,450 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-26 08:38:23,619 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 08:38:23,980 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-26 08:38:24,181 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 08:38:24,852 INFO L154 LiptonReduction]: Checked pairs total: 4646 [2021-03-26 08:38:24,852 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-26 08:38:24,852 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1863 [2021-03-26 08:38:24,855 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 317 flow [2021-03-26 08:38:24,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 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-26 08:38:24,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:24,855 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:24,855 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 08:38:24,856 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-26 08:38:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1127746976, now seen corresponding path program 1 times [2021-03-26 08:38:24,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:24,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624134735] [2021-03-26 08:38:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:24,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:24,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:24,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:24,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:24,950 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-26 08:38:24,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624134735] [2021-03-26 08:38:24,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:24,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:38:24,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278656007] [2021-03-26 08:38:24,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:24,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:24,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:24,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2021-03-26 08:38:24,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 89 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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-26 08:38:24,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:24,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2021-03-26 08:38:24,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:25,001 INFO L129 PetriNetUnfolder]: 119/451 cut-off events. [2021-03-26 08:38:25,002 INFO L130 PetriNetUnfolder]: For 98/104 co-relation queries the response was YES. [2021-03-26 08:38:25,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 451 events. 119/451 cut-off events. For 98/104 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2972 event pairs, 8 based on Foata normal form. 7/423 useless extension candidates. Maximal degree in co-relation 556. Up to 60 conditions per place. [2021-03-26 08:38:25,005 INFO L132 encePairwiseOnDemand]: 294/297 looper letters, 6 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-03-26 08:38:25,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 337 flow [2021-03-26 08:38:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2021-03-26 08:38:25,007 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2021-03-26 08:38:25,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2021-03-26 08:38:25,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2021-03-26 08:38:25,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:25,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2021-03-26 08:38:25,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:38:25,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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-26 08:38:25,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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-26 08:38:25,012 INFO L185 Difference]: Start difference. First operand has 70 places, 89 transitions, 317 flow. Second operand 3 states and 813 transitions. [2021-03-26 08:38:25,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 337 flow [2021-03-26 08:38:25,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:38:25,018 INFO L241 Difference]: Finished difference. Result has 71 places, 89 transitions, 321 flow [2021-03-26 08:38:25,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2021-03-26 08:38:25,018 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2021-03-26 08:38:25,018 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:25,018 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-26 08:38:25,019 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-26 08:38:25,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 321 flow [2021-03-26 08:38:25,045 INFO L129 PetriNetUnfolder]: 97/394 cut-off events. [2021-03-26 08:38:25,045 INFO L130 PetriNetUnfolder]: For 95/100 co-relation queries the response was YES. [2021-03-26 08:38:25,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 394 events. 97/394 cut-off events. For 95/100 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2564 event pairs, 3 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 495. Up to 50 conditions per place. [2021-03-26 08:38:25,050 INFO L142 LiptonReduction]: Number of co-enabled transitions 3086 [2021-03-26 08:38:25,267 INFO L154 LiptonReduction]: Checked pairs total: 5178 [2021-03-26 08:38:25,267 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 08:38:25,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 249 [2021-03-26 08:38:25,269 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 321 flow [2021-03-26 08:38:25,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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-26 08:38:25,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:25,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:25,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 08:38:25,271 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-26 08:38:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 274289960, now seen corresponding path program 1 times [2021-03-26 08:38:25,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:25,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679253300] [2021-03-26 08:38:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:25,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:25,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:25,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:25,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:25,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:25,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:25,399 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-26 08:38:25,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679253300] [2021-03-26 08:38:25,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:25,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 08:38:25,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012304458] [2021-03-26 08:38:25,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:38:25,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:38:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:38:25,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 302 [2021-03-26 08:38:25,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 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-26 08:38:25,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:25,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 302 [2021-03-26 08:38:25,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:25,744 INFO L129 PetriNetUnfolder]: 1554/3282 cut-off events. [2021-03-26 08:38:25,745 INFO L130 PetriNetUnfolder]: For 843/956 co-relation queries the response was YES. [2021-03-26 08:38:25,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 3282 events. 1554/3282 cut-off events. For 843/956 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 24731 event pairs, 416 based on Foata normal form. 54/3037 useless extension candidates. Maximal degree in co-relation 2760. Up to 1103 conditions per place. [2021-03-26 08:38:25,775 INFO L132 encePairwiseOnDemand]: 291/302 looper letters, 39 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2021-03-26 08:38:25,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 550 flow [2021-03-26 08:38:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:38:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:38:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1577 transitions. [2021-03-26 08:38:25,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7459791863765374 [2021-03-26 08:38:25,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1577 transitions. [2021-03-26 08:38:25,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1577 transitions. [2021-03-26 08:38:25,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:25,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1577 transitions. [2021-03-26 08:38:25,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 225.28571428571428) internal successors, (1577), 7 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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-26 08:38:25,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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-26 08:38:25,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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-26 08:38:25,788 INFO L185 Difference]: Start difference. First operand has 71 places, 89 transitions, 321 flow. Second operand 7 states and 1577 transitions. [2021-03-26 08:38:25,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 550 flow [2021-03-26 08:38:25,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:38:25,802 INFO L241 Difference]: Finished difference. Result has 79 places, 107 transitions, 468 flow [2021-03-26 08:38:25,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=79, PETRI_TRANSITIONS=107} [2021-03-26 08:38:25,802 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2021-03-26 08:38:25,802 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:25,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 107 transitions, 468 flow [2021-03-26 08:38:25,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 107 transitions, 468 flow [2021-03-26 08:38:25,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 107 transitions, 468 flow [2021-03-26 08:38:25,852 INFO L129 PetriNetUnfolder]: 204/808 cut-off events. [2021-03-26 08:38:25,853 INFO L130 PetriNetUnfolder]: For 326/349 co-relation queries the response was YES. [2021-03-26 08:38:25,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 808 events. 204/808 cut-off events. For 326/349 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6469 event pairs, 10 based on Foata normal form. 5/774 useless extension candidates. Maximal degree in co-relation 1317. Up to 78 conditions per place. [2021-03-26 08:38:25,865 INFO L142 LiptonReduction]: Number of co-enabled transitions 3808 [2021-03-26 08:38:25,960 INFO L154 LiptonReduction]: Checked pairs total: 1664 [2021-03-26 08:38:25,960 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:25,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 158 [2021-03-26 08:38:25,965 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 107 transitions, 468 flow [2021-03-26 08:38:25,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 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-26 08:38:25,965 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:25,965 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:25,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 08:38:25,966 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-26 08:38:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1440046171, now seen corresponding path program 1 times [2021-03-26 08:38:25,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:25,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132700393] [2021-03-26 08:38:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:26,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:26,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:38:26,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:26,007 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-26 08:38:26,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132700393] [2021-03-26 08:38:26,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:26,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 08:38:26,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875021220] [2021-03-26 08:38:26,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:26,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:26,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 302 [2021-03-26 08:38:26,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 107 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-26 08:38:26,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:26,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 302 [2021-03-26 08:38:26,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:26,090 INFO L129 PetriNetUnfolder]: 209/780 cut-off events. [2021-03-26 08:38:26,090 INFO L130 PetriNetUnfolder]: For 448/571 co-relation queries the response was YES. [2021-03-26 08:38:26,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1693 conditions, 780 events. 209/780 cut-off events. For 448/571 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5942 event pairs, 12 based on Foata normal form. 15/755 useless extension candidates. Maximal degree in co-relation 1460. Up to 107 conditions per place. [2021-03-26 08:38:26,098 INFO L132 encePairwiseOnDemand]: 299/302 looper letters, 30 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2021-03-26 08:38:26,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 538 flow [2021-03-26 08:38:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2021-03-26 08:38:26,100 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8830022075055187 [2021-03-26 08:38:26,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2021-03-26 08:38:26,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2021-03-26 08:38:26,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:26,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2021-03-26 08:38:26,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-26 08:38:26,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:26,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:26,104 INFO L185 Difference]: Start difference. First operand has 79 places, 107 transitions, 468 flow. Second operand 3 states and 800 transitions. [2021-03-26 08:38:26,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 538 flow [2021-03-26 08:38:26,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:26,112 INFO L241 Difference]: Finished difference. Result has 83 places, 108 transitions, 490 flow [2021-03-26 08:38:26,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2021-03-26 08:38:26,112 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2021-03-26 08:38:26,112 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:26,112 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 108 transitions, 490 flow [2021-03-26 08:38:26,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 108 transitions, 490 flow [2021-03-26 08:38:26,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 108 transitions, 490 flow [2021-03-26 08:38:26,180 INFO L129 PetriNetUnfolder]: 205/809 cut-off events. [2021-03-26 08:38:26,180 INFO L130 PetriNetUnfolder]: For 445/466 co-relation queries the response was YES. [2021-03-26 08:38:26,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 809 events. 205/809 cut-off events. For 445/466 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6460 event pairs, 11 based on Foata normal form. 7/777 useless extension candidates. Maximal degree in co-relation 1393. Up to 76 conditions per place. [2021-03-26 08:38:26,194 INFO L142 LiptonReduction]: Number of co-enabled transitions 3866 [2021-03-26 08:38:26,233 INFO L154 LiptonReduction]: Checked pairs total: 1680 [2021-03-26 08:38:26,233 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:26,233 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-03-26 08:38:26,235 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 490 flow [2021-03-26 08:38:26,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-26 08:38:26,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:26,236 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:26,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 08:38:26,236 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-26 08:38:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1595253721, now seen corresponding path program 1 times [2021-03-26 08:38:26,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:26,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355715341] [2021-03-26 08:38:26,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:26,284 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:26,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:26,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:26,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:26,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:26,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:26,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:26,309 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-26 08:38:26,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355715341] [2021-03-26 08:38:26,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:26,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:38:26,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808563821] [2021-03-26 08:38:26,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:26,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:26,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 302 [2021-03-26 08:38:26,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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-26 08:38:26,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:26,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 302 [2021-03-26 08:38:26,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:26,720 INFO L129 PetriNetUnfolder]: 899/1991 cut-off events. [2021-03-26 08:38:26,720 INFO L130 PetriNetUnfolder]: For 2452/2465 co-relation queries the response was YES. [2021-03-26 08:38:26,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 1991 events. 899/1991 cut-off events. For 2452/2465 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15059 event pairs, 33 based on Foata normal form. 119/2010 useless extension candidates. Maximal degree in co-relation 4716. Up to 625 conditions per place. [2021-03-26 08:38:26,740 INFO L132 encePairwiseOnDemand]: 278/302 looper letters, 93 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2021-03-26 08:38:26,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 1022 flow [2021-03-26 08:38:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:38:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:38:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1548 transitions. [2021-03-26 08:38:26,743 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322611163670766 [2021-03-26 08:38:26,743 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1548 transitions. [2021-03-26 08:38:26,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1548 transitions. [2021-03-26 08:38:26,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:26,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1548 transitions. [2021-03-26 08:38:26,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.14285714285714) internal successors, (1548), 7 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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-26 08:38:26,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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-26 08:38:26,752 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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-26 08:38:26,752 INFO L185 Difference]: Start difference. First operand has 83 places, 108 transitions, 490 flow. Second operand 7 states and 1548 transitions. [2021-03-26 08:38:26,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 1022 flow [2021-03-26 08:38:26,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 167 transitions, 1010 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 08:38:26,762 INFO L241 Difference]: Finished difference. Result has 93 places, 132 transitions, 761 flow [2021-03-26 08:38:26,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=93, PETRI_TRANSITIONS=132} [2021-03-26 08:38:26,763 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2021-03-26 08:38:26,763 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:26,763 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 132 transitions, 761 flow [2021-03-26 08:38:26,763 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 132 transitions, 761 flow [2021-03-26 08:38:26,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 132 transitions, 761 flow [2021-03-26 08:38:26,819 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][120], [Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 212#true, 21#L786-2true, Black: 182#(= ~readerprogress1~0 0)]) [2021-03-26 08:38:26,819 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:26,819 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:26,819 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:26,819 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:26,866 INFO L129 PetriNetUnfolder]: 445/1383 cut-off events. [2021-03-26 08:38:26,867 INFO L130 PetriNetUnfolder]: For 2308/2363 co-relation queries the response was YES. [2021-03-26 08:38:26,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 1383 events. 445/1383 cut-off events. For 2308/2363 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11925 event pairs, 15 based on Foata normal form. 20/1328 useless extension candidates. Maximal degree in co-relation 3385. Up to 226 conditions per place. [2021-03-26 08:38:26,890 INFO L142 LiptonReduction]: Number of co-enabled transitions 4708 [2021-03-26 08:38:27,002 INFO L154 LiptonReduction]: Checked pairs total: 1526 [2021-03-26 08:38:27,002 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:27,002 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 239 [2021-03-26 08:38:27,006 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 132 transitions, 761 flow [2021-03-26 08:38:27,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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-26 08:38:27,007 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:27,007 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:27,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 08:38:27,007 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-26 08:38:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash 958500985, now seen corresponding path program 1 times [2021-03-26 08:38:27,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:27,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896663602] [2021-03-26 08:38:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:27,055 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:27,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:27,061 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:27,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:27,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:27,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:27,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:27,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:27,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:27,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:27,097 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-26 08:38:27,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896663602] [2021-03-26 08:38:27,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:27,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:38:27,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280844648] [2021-03-26 08:38:27,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:27,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:27,099 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 302 [2021-03-26 08:38:27,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 132 transitions, 761 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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-26 08:38:27,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:27,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 302 [2021-03-26 08:38:27,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:27,478 INFO L129 PetriNetUnfolder]: 929/2047 cut-off events. [2021-03-26 08:38:27,478 INFO L130 PetriNetUnfolder]: For 5284/5369 co-relation queries the response was YES. [2021-03-26 08:38:27,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 2047 events. 929/2047 cut-off events. For 5284/5369 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15614 event pairs, 80 based on Foata normal form. 44/1990 useless extension candidates. Maximal degree in co-relation 6299. Up to 662 conditions per place. [2021-03-26 08:38:27,506 INFO L132 encePairwiseOnDemand]: 285/302 looper letters, 95 selfloop transitions, 21 changer transitions 0/161 dead transitions. [2021-03-26 08:38:27,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 161 transitions, 1198 flow [2021-03-26 08:38:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:38:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:38:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1300 transitions. [2021-03-26 08:38:27,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.717439293598234 [2021-03-26 08:38:27,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1300 transitions. [2021-03-26 08:38:27,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1300 transitions. [2021-03-26 08:38:27,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:27,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1300 transitions. [2021-03-26 08:38:27,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 0 states have call successors, (0), 0 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-26 08:38:27,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-26 08:38:27,516 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-26 08:38:27,516 INFO L185 Difference]: Start difference. First operand has 93 places, 132 transitions, 761 flow. Second operand 6 states and 1300 transitions. [2021-03-26 08:38:27,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 161 transitions, 1198 flow [2021-03-26 08:38:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 161 transitions, 1179 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-26 08:38:27,531 INFO L241 Difference]: Finished difference. Result has 100 places, 140 transitions, 915 flow [2021-03-26 08:38:27,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=915, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2021-03-26 08:38:27,531 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2021-03-26 08:38:27,531 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:27,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 140 transitions, 915 flow [2021-03-26 08:38:27,532 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 140 transitions, 915 flow [2021-03-26 08:38:27,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 140 transitions, 915 flow [2021-03-26 08:38:27,583 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][76], [Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 212#true, 21#L786-2true, Black: 182#(= ~readerprogress1~0 0)]) [2021-03-26 08:38:27,583 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,583 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,583 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:27,583 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,584 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][76], [Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 45#L744-3true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 212#true, 21#L786-2true, Black: 182#(= ~readerprogress1~0 0)]) [2021-03-26 08:38:27,584 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:27,584 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,584 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,584 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:27,584 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,585 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][48], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0)]) [2021-03-26 08:38:27,585 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:27,585 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,585 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:27,585 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:27,595 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][22], [Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 45#L744-3true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 212#true, 21#L786-2true, Black: 182#(= ~readerprogress1~0 0), 157#L767-4true]) [2021-03-26 08:38:27,595 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:27,595 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:27,596 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:27,596 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:27,654 INFO L129 PetriNetUnfolder]: 515/1538 cut-off events. [2021-03-26 08:38:27,655 INFO L130 PetriNetUnfolder]: For 3629/3729 co-relation queries the response was YES. [2021-03-26 08:38:27,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4431 conditions, 1538 events. 515/1538 cut-off events. For 3629/3729 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13309 event pairs, 17 based on Foata normal form. 22/1474 useless extension candidates. Maximal degree in co-relation 4021. Up to 250 conditions per place. [2021-03-26 08:38:27,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 4992 [2021-03-26 08:38:27,787 INFO L154 LiptonReduction]: Checked pairs total: 1597 [2021-03-26 08:38:27,787 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:27,787 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 256 [2021-03-26 08:38:27,788 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 915 flow [2021-03-26 08:38:27,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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-26 08:38:27,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:27,789 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:27,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 08:38:27,789 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-26 08:38:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash -680330820, now seen corresponding path program 1 times [2021-03-26 08:38:27,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:27,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669238395] [2021-03-26 08:38:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:27,844 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:27,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:27,851 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-03-26 08:38:27,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:27,859 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-03-26 08:38:27,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:27,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:27,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:38:27,874 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-26 08:38:27,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669238395] [2021-03-26 08:38:27,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:27,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:38:27,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470823098] [2021-03-26 08:38:27,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:27,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:27,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 302 [2021-03-26 08:38:27,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 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-26 08:38:27,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:27,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 302 [2021-03-26 08:38:27,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:31,189 INFO L129 PetriNetUnfolder]: 22769/33339 cut-off events. [2021-03-26 08:38:31,189 INFO L130 PetriNetUnfolder]: For 55238/56047 co-relation queries the response was YES. [2021-03-26 08:38:31,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97898 conditions, 33339 events. 22769/33339 cut-off events. For 55238/56047 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 239841 event pairs, 3211 based on Foata normal form. 482/25517 useless extension candidates. Maximal degree in co-relation 88726. Up to 14451 conditions per place. [2021-03-26 08:38:31,466 INFO L132 encePairwiseOnDemand]: 287/302 looper letters, 176 selfloop transitions, 27 changer transitions 0/250 dead transitions. [2021-03-26 08:38:31,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 250 transitions, 1843 flow [2021-03-26 08:38:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:38:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:38:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1105 transitions. [2021-03-26 08:38:31,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6098233995584988 [2021-03-26 08:38:31,469 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1105 transitions. [2021-03-26 08:38:31,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1105 transitions. [2021-03-26 08:38:31,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:31,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1105 transitions. [2021-03-26 08:38:31,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-26 08:38:31,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-26 08:38:31,475 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-26 08:38:31,475 INFO L185 Difference]: Start difference. First operand has 100 places, 140 transitions, 915 flow. Second operand 6 states and 1105 transitions. [2021-03-26 08:38:31,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 250 transitions, 1843 flow [2021-03-26 08:38:32,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 250 transitions, 1814 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:38:32,038 INFO L241 Difference]: Finished difference. Result has 106 places, 160 transitions, 1151 flow [2021-03-26 08:38:32,038 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1151, PETRI_PLACES=106, PETRI_TRANSITIONS=160} [2021-03-26 08:38:32,038 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2021-03-26 08:38:32,038 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:32,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 160 transitions, 1151 flow [2021-03-26 08:38:32,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 160 transitions, 1151 flow [2021-03-26 08:38:32,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 160 transitions, 1151 flow [2021-03-26 08:38:32,123 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][89], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 228#true, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,123 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,123 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,123 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:32,123 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,132 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][89], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,132 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:32,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,132 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:32,132 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,147 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][27], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, 157#L767-4true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,147 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:32,147 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:32,147 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:32,147 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:32,149 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][69], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,149 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,149 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,149 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,149 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:32,151 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][63], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,151 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:32,151 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:32,152 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:32,152 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:32,167 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][69], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 138#L770-1true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:32,168 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 08:38:32,168 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:32,168 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:32,168 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:32,226 INFO L129 PetriNetUnfolder]: 929/2652 cut-off events. [2021-03-26 08:38:32,226 INFO L130 PetriNetUnfolder]: For 6931/7092 co-relation queries the response was YES. [2021-03-26 08:38:32,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7990 conditions, 2652 events. 929/2652 cut-off events. For 6931/7092 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25188 event pairs, 45 based on Foata normal form. 34/2478 useless extension candidates. Maximal degree in co-relation 7244. Up to 403 conditions per place. [2021-03-26 08:38:32,270 INFO L142 LiptonReduction]: Number of co-enabled transitions 5388 [2021-03-26 08:38:32,759 INFO L154 LiptonReduction]: Checked pairs total: 1240 [2021-03-26 08:38:32,759 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:32,759 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 721 [2021-03-26 08:38:32,760 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 160 transitions, 1151 flow [2021-03-26 08:38:32,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 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-26 08:38:32,760 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:32,760 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:32,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 08:38:32,761 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-26 08:38:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1974045586, now seen corresponding path program 1 times [2021-03-26 08:38:32,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:32,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139825897] [2021-03-26 08:38:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:32,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:32,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:32,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:32,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:32,800 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-26 08:38:32,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139825897] [2021-03-26 08:38:32,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:32,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:38:32,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746798793] [2021-03-26 08:38:32,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:32,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:32,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:32,802 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 302 [2021-03-26 08:38:32,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 160 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-26 08:38:32,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:32,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 302 [2021-03-26 08:38:32,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:33,010 INFO L129 PetriNetUnfolder]: 851/2285 cut-off events. [2021-03-26 08:38:33,011 INFO L130 PetriNetUnfolder]: For 6610/6825 co-relation queries the response was YES. [2021-03-26 08:38:33,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6927 conditions, 2285 events. 851/2285 cut-off events. For 6610/6825 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19879 event pairs, 52 based on Foata normal form. 35/2117 useless extension candidates. Maximal degree in co-relation 6448. Up to 330 conditions per place. [2021-03-26 08:38:33,038 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 14 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2021-03-26 08:38:33,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 1189 flow [2021-03-26 08:38:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2021-03-26 08:38:33,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9271523178807947 [2021-03-26 08:38:33,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2021-03-26 08:38:33,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2021-03-26 08:38:33,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:33,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2021-03-26 08:38:33,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 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-26 08:38:33,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:33,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:33,045 INFO L185 Difference]: Start difference. First operand has 106 places, 160 transitions, 1151 flow. Second operand 3 states and 840 transitions. [2021-03-26 08:38:33,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 162 transitions, 1189 flow [2021-03-26 08:38:33,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 162 transitions, 1189 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:33,068 INFO L241 Difference]: Finished difference. Result has 109 places, 160 transitions, 1156 flow [2021-03-26 08:38:33,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=109, PETRI_TRANSITIONS=160} [2021-03-26 08:38:33,069 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 31 predicate places. [2021-03-26 08:38:33,069 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:33,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 160 transitions, 1156 flow [2021-03-26 08:38:33,069 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 160 transitions, 1156 flow [2021-03-26 08:38:33,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 160 transitions, 1156 flow [2021-03-26 08:38:33,175 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][90], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 228#true, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,175 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,175 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,175 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,175 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:33,185 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][90], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,185 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:33,185 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,185 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,186 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,186 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:33,204 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][29], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, 157#L767-4true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 228#true, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,204 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:33,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:33,205 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:33,205 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:33,207 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][70], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,207 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,207 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,207 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,207 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:33,209 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][64], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,210 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:33,210 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:33,210 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:33,210 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:33,229 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][70], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 138#L770-1true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:33,229 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 08:38:33,229 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:33,229 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:33,229 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:33,329 INFO L129 PetriNetUnfolder]: 932/2721 cut-off events. [2021-03-26 08:38:33,330 INFO L130 PetriNetUnfolder]: For 7001/7162 co-relation queries the response was YES. [2021-03-26 08:38:33,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8128 conditions, 2721 events. 932/2721 cut-off events. For 7001/7162 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 25946 event pairs, 46 based on Foata normal form. 35/2549 useless extension candidates. Maximal degree in co-relation 7330. Up to 403 conditions per place. [2021-03-26 08:38:33,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 5370 [2021-03-26 08:38:33,726 INFO L154 LiptonReduction]: Checked pairs total: 1145 [2021-03-26 08:38:33,726 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:33,726 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 657 [2021-03-26 08:38:33,727 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 160 transitions, 1156 flow [2021-03-26 08:38:33,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-26 08:38:33,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:33,728 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:33,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 08:38:33,728 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-26 08:38:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash -429431282, now seen corresponding path program 1 times [2021-03-26 08:38:33,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:33,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461383120] [2021-03-26 08:38:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:33,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:33,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:33,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:33,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:33,758 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-26 08:38:33,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461383120] [2021-03-26 08:38:33,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:33,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:38:33,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490304511] [2021-03-26 08:38:33,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:33,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:33,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 302 [2021-03-26 08:38:33,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 160 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 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-26 08:38:33,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:33,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 302 [2021-03-26 08:38:33,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:34,042 INFO L129 PetriNetUnfolder]: 865/2343 cut-off events. [2021-03-26 08:38:34,042 INFO L130 PetriNetUnfolder]: For 6834/7101 co-relation queries the response was YES. [2021-03-26 08:38:34,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 2343 events. 865/2343 cut-off events. For 6834/7101 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20437 event pairs, 54 based on Foata normal form. 60/2196 useless extension candidates. Maximal degree in co-relation 6614. Up to 334 conditions per place. [2021-03-26 08:38:34,056 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 15 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2021-03-26 08:38:34,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 162 transitions, 1196 flow [2021-03-26 08:38:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2021-03-26 08:38:34,059 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9139072847682119 [2021-03-26 08:38:34,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2021-03-26 08:38:34,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2021-03-26 08:38:34,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:34,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2021-03-26 08:38:34,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-26 08:38:34,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:34,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 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-26 08:38:34,063 INFO L185 Difference]: Start difference. First operand has 109 places, 160 transitions, 1156 flow. Second operand 3 states and 828 transitions. [2021-03-26 08:38:34,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 162 transitions, 1196 flow [2021-03-26 08:38:34,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 08:38:34,080 INFO L241 Difference]: Finished difference. Result has 111 places, 160 transitions, 1162 flow [2021-03-26 08:38:34,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=111, PETRI_TRANSITIONS=160} [2021-03-26 08:38:34,081 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2021-03-26 08:38:34,081 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:34,081 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 160 transitions, 1162 flow [2021-03-26 08:38:34,082 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 160 transitions, 1162 flow [2021-03-26 08:38:34,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 160 transitions, 1162 flow [2021-03-26 08:38:34,162 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][91], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, 135#L767-8true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,163 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,163 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,163 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,163 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:34,171 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][91], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, 135#L767-8true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,172 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:34,172 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,172 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,172 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:34,172 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,184 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][29], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, 157#L767-4true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 228#true, 165#true, 45#L744-3true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,185 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:34,185 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:34,185 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:34,185 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:34,186 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][70], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,186 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,186 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:34,188 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([798] L766-8-->L767-10: Formula: (not (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_17 1)) InVars {qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} OutVars{qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_17} AuxVars[] AssignedVars[][63], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 140#L767-10true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,188 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:38:34,199 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][70], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#true, Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 138#L770-1true, Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 21#L786-2true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:34,199 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-26 08:38:34,199 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:34,199 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:34,199 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-26 08:38:34,261 INFO L129 PetriNetUnfolder]: 934/2724 cut-off events. [2021-03-26 08:38:34,261 INFO L130 PetriNetUnfolder]: For 7027/7187 co-relation queries the response was YES. [2021-03-26 08:38:34,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8182 conditions, 2724 events. 934/2724 cut-off events. For 7027/7187 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 25970 event pairs, 46 based on Foata normal form. 34/2551 useless extension candidates. Maximal degree in co-relation 7375. Up to 403 conditions per place. [2021-03-26 08:38:34,297 INFO L142 LiptonReduction]: Number of co-enabled transitions 5334 [2021-03-26 08:38:34,597 INFO L154 LiptonReduction]: Checked pairs total: 1143 [2021-03-26 08:38:34,597 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:34,597 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 516 [2021-03-26 08:38:34,597 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 160 transitions, 1162 flow [2021-03-26 08:38:34,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 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-26 08:38:34,598 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:34,598 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:34,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 08:38:34,598 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-26 08:38:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024596, now seen corresponding path program 1 times [2021-03-26 08:38:34,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:34,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528828032] [2021-03-26 08:38:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:34,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:34,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:34,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:34,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:34,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:34,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:34,632 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-26 08:38:34,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528828032] [2021-03-26 08:38:34,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:34,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 08:38:34,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543379986] [2021-03-26 08:38:34,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 08:38:34,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 08:38:34,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 08:38:34,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 302 [2021-03-26 08:38:34,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 160 transitions, 1162 flow. Second operand has 4 states, 4 states have (on average 250.5) internal successors, (1002), 4 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-26 08:38:34,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:34,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 302 [2021-03-26 08:38:34,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:35,137 INFO L129 PetriNetUnfolder]: 2546/6036 cut-off events. [2021-03-26 08:38:35,137 INFO L130 PetriNetUnfolder]: For 13276/14143 co-relation queries the response was YES. [2021-03-26 08:38:35,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17665 conditions, 6036 events. 2546/6036 cut-off events. For 13276/14143 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 56072 event pairs, 131 based on Foata normal form. 184/5049 useless extension candidates. Maximal degree in co-relation 15426. Up to 1468 conditions per place. [2021-03-26 08:38:35,187 INFO L132 encePairwiseOnDemand]: 291/302 looper letters, 53 selfloop transitions, 20 changer transitions 0/191 dead transitions. [2021-03-26 08:38:35,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 191 transitions, 1426 flow [2021-03-26 08:38:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:38:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:38:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1304 transitions. [2021-03-26 08:38:35,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8635761589403973 [2021-03-26 08:38:35,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1304 transitions. [2021-03-26 08:38:35,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1304 transitions. [2021-03-26 08:38:35,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:35,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1304 transitions. [2021-03-26 08:38:35,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 260.8) internal successors, (1304), 5 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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-26 08:38:35,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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-26 08:38:35,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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-26 08:38:35,196 INFO L185 Difference]: Start difference. First operand has 111 places, 160 transitions, 1162 flow. Second operand 5 states and 1304 transitions. [2021-03-26 08:38:35,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 191 transitions, 1426 flow [2021-03-26 08:38:35,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 191 transitions, 1425 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 08:38:35,277 INFO L241 Difference]: Finished difference. Result has 114 places, 171 transitions, 1325 flow [2021-03-26 08:38:35,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1325, PETRI_PLACES=114, PETRI_TRANSITIONS=171} [2021-03-26 08:38:35,277 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2021-03-26 08:38:35,277 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:35,278 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 171 transitions, 1325 flow [2021-03-26 08:38:35,278 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 171 transitions, 1325 flow [2021-03-26 08:38:35,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 171 transitions, 1325 flow [2021-03-26 08:38:35,377 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][98], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:35,377 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:35,377 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:35,377 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:35,377 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:35,548 INFO L129 PetriNetUnfolder]: 1121/3455 cut-off events. [2021-03-26 08:38:35,548 INFO L130 PetriNetUnfolder]: For 6925/7145 co-relation queries the response was YES. [2021-03-26 08:38:35,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10114 conditions, 3455 events. 1121/3455 cut-off events. For 6925/7145 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 33941 event pairs, 71 based on Foata normal form. 77/3268 useless extension candidates. Maximal degree in co-relation 8994. Up to 360 conditions per place. [2021-03-26 08:38:35,602 INFO L142 LiptonReduction]: Number of co-enabled transitions 6120 [2021-03-26 08:38:37,314 INFO L154 LiptonReduction]: Checked pairs total: 2273 [2021-03-26 08:38:37,315 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 08:38:37,315 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2038 [2021-03-26 08:38:37,315 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 170 transitions, 1337 flow [2021-03-26 08:38:37,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 250.5) internal successors, (1002), 4 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-26 08:38:37,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:37,316 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:37,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 08:38:37,317 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-26 08:38:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1917866992, now seen corresponding path program 1 times [2021-03-26 08:38:37,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:37,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751747359] [2021-03-26 08:38:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:37,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:37,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:37,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:37,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:37,354 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-26 08:38:37,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751747359] [2021-03-26 08:38:37,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:37,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:38:37,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369014380] [2021-03-26 08:38:37,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 08:38:37,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:37,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 08:38:37,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 08:38:37,357 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 304 [2021-03-26 08:38:37,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 170 transitions, 1337 flow. Second operand has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 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-26 08:38:37,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:37,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 304 [2021-03-26 08:38:37,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:37,692 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 275#true, 20#qrcu_updaterEXITtrue, 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 152#L757true, 95#L738true, Black: 212#true, Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 165#true, Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:37,692 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-03-26 08:38:37,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 08:38:37,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 08:38:37,692 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-26 08:38:37,738 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 275#true, 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 152#L757true, Black: 212#true, 95#L738true, Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 165#true, Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 190#true]) [2021-03-26 08:38:37,738 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,738 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,738 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,738 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,742 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][146], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 138#L770-1true, Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, 110#qrcu_reader2EXITtrue, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:37,742 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,742 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,742 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,742 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:37,789 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][146], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 138#L770-1true, Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:37,789 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 08:38:37,789 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:37,789 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:37,789 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:37,973 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), 275#true, Black: 206#true, 20#qrcu_updaterEXITtrue, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, 95#L738true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 190#true]) [2021-03-26 08:38:37,973 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,997 INFO L382 tUnfolder$Statistics]: inserting event number 5 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), 275#true, Black: 206#true, 20#qrcu_updaterEXITtrue, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, 95#L738true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 190#true]) [2021-03-26 08:38:37,997 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2021-03-26 08:38:37,997 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,997 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,997 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:37,997 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:38,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L767-10-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_13| (select (select |v_#memory_int_63| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|)) (not (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~mem22][117], [256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 141#L789-1true, 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 165#true, Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,028 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,028 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,028 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,028 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,033 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 275#true, 20#qrcu_updaterEXITtrue, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 95#L738true, Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:38,033 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L382 tUnfolder$Statistics]: inserting event number 6 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 206#true, 275#true, 20#qrcu_updaterEXITtrue, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 95#L738true, Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 116#L787-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:38,033 INFO L384 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2021-03-26 08:38:38,033 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,034 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,034 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:38:38,036 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L767-10-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_13| (select (select |v_#memory_int_63| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|)) (not (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_19|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_17|, #memory_int=|v_#memory_int_63|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_13|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_45} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~mem22][117], [256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 141#L789-1true, 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 165#true, Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,036 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:38:38,036 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:38,036 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:38,036 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:38:38,040 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 206#true, 275#true, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 95#L738true, Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:38,040 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,040 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,040 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,040 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,057 INFO L382 tUnfolder$Statistics]: inserting event number 5 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), 275#true, Black: 206#true, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, 95#L738true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 240#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 190#true]) [2021-03-26 08:38:38,057 INFO L384 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,057 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,057 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,057 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,057 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,072 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, Black: 206#true, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, 95#L738true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:38,072 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,072 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,072 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,072 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,072 INFO L382 tUnfolder$Statistics]: inserting event number 6 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][78], [Black: 256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 206#true, 275#true, 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, 95#L738true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-26 08:38:38,072 INFO L384 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,072 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,073 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,073 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,073 INFO L387 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2021-03-26 08:38:38,073 INFO L387 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2021-03-26 08:38:38,099 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([960] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_439)) (= (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|) |v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|) (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#mutex~0.base_34| (store (select |v_#pthreadsMutex_24| |v_~#mutex~0.base_34|) |v_~#mutex~0.offset_34| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|, #pthreadsMutex=|v_#pthreadsMutex_24|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|, ~#mutex~0.base=|v_~#mutex~0.base_34|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, ~ctr1~0=v_~ctr1~0_439} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|, #pthreadsMutex=|v_#pthreadsMutex_23|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|, ~#mutex~0.base=|v_~#mutex~0.base_34|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|, ~ctr1~0=v_~ctr1~0_439} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][172], [256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,099 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,099 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,099 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,099 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_43| (select (select |v_#memory_int_187| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|)) (not (< 0 v_~ctr2~0_426)) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_36| (store (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_36|) |v_~#mutex~0.offset_36| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_187|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_426} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_187|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_43|, ~ctr2~0=v_~ctr2~0_426} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][175], [256#(= ~readerprogress1~0 2), Black: 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 206#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 152#L757true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,100 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,100 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,100 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,100 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-26 08:38:38,137 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([960] L773-2-->L777: Formula: (and (not (< 0 v_~ctr1~0_439)) (= (select (select |v_#memory_int_185| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|) |v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|) (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#mutex~0.base_34| (store (select |v_#pthreadsMutex_24| |v_~#mutex~0.base_34|) |v_~#mutex~0.offset_34| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|, #pthreadsMutex=|v_#pthreadsMutex_24|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|, ~#mutex~0.base=|v_~#mutex~0.base_34|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, ~ctr1~0=v_~ctr1~0_439} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_73|, #pthreadsMutex=|v_#pthreadsMutex_23|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_65|, ~#mutex~0.base=|v_~#mutex~0.base_34|, #memory_int=|v_#memory_int_185|, ~#mutex~0.offset=|v_~#mutex~0.offset_34|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_41|, ~ctr1~0=v_~ctr1~0_439} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][172], [256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 42#L758true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,137 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,137 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,137 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,137 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_43| (select (select |v_#memory_int_187| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|)) (not (< 0 v_~ctr2~0_426)) (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#mutex~0.base_36| (store (select |v_#pthreadsMutex_28| |v_~#mutex~0.base_36|) |v_~#mutex~0.offset_36| 0)))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_187|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_426} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_75|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_67|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_187|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_43|, ~ctr2~0=v_~ctr2~0_426} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][175], [256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 206#true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 42#L758true, Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 240#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 51#L788-1true, Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 62#L777true]) [2021-03-26 08:38:38,138 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,138 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,138 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,138 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-26 08:38:38,187 INFO L129 PetriNetUnfolder]: 3990/8556 cut-off events. [2021-03-26 08:38:38,188 INFO L130 PetriNetUnfolder]: For 20540/21669 co-relation queries the response was YES. [2021-03-26 08:38:38,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28575 conditions, 8556 events. 3990/8556 cut-off events. For 20540/21669 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 78058 event pairs, 406 based on Foata normal form. 304/7997 useless extension candidates. Maximal degree in co-relation 21339. Up to 1257 conditions per place. [2021-03-26 08:38:38,245 INFO L132 encePairwiseOnDemand]: 298/304 looper letters, 43 selfloop transitions, 22 changer transitions 0/197 dead transitions. [2021-03-26 08:38:38,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 1591 flow [2021-03-26 08:38:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:38:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:38:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1174 transitions. [2021-03-26 08:38:38,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7723684210526316 [2021-03-26 08:38:38,248 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1174 transitions. [2021-03-26 08:38:38,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1174 transitions. [2021-03-26 08:38:38,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:38,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1174 transitions. [2021-03-26 08:38:38,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 234.8) internal successors, (1174), 5 states have internal predecessors, (1174), 0 states have call successors, (0), 0 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-26 08:38:38,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-26 08:38:38,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 0 states have call successors, (0), 0 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-26 08:38:38,253 INFO L185 Difference]: Start difference. First operand has 113 places, 170 transitions, 1337 flow. Second operand 5 states and 1174 transitions. [2021-03-26 08:38:38,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 197 transitions, 1591 flow [2021-03-26 08:38:38,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 197 transitions, 1579 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:38,319 INFO L241 Difference]: Finished difference. Result has 119 places, 176 transitions, 1428 flow [2021-03-26 08:38:38,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1428, PETRI_PLACES=119, PETRI_TRANSITIONS=176} [2021-03-26 08:38:38,319 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 41 predicate places. [2021-03-26 08:38:38,319 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:38,319 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 176 transitions, 1428 flow [2021-03-26 08:38:38,319 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 176 transitions, 1428 flow [2021-03-26 08:38:38,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 176 transitions, 1428 flow [2021-03-26 08:38:38,388 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][107], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 277#(= ~readerprogress2~0 0), Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:38,388 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 08:38:38,388 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:38,388 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 08:38:38,388 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:38,504 INFO L129 PetriNetUnfolder]: 1112/3293 cut-off events. [2021-03-26 08:38:38,504 INFO L130 PetriNetUnfolder]: For 7885/8142 co-relation queries the response was YES. [2021-03-26 08:38:38,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 3293 events. 1112/3293 cut-off events. For 7885/8142 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31740 event pairs, 60 based on Foata normal form. 81/3124 useless extension candidates. Maximal degree in co-relation 9099. Up to 354 conditions per place. [2021-03-26 08:38:38,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 5966 [2021-03-26 08:38:39,254 INFO L154 LiptonReduction]: Checked pairs total: 1070 [2021-03-26 08:38:39,254 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:39,255 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 936 [2021-03-26 08:38:39,255 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 176 transitions, 1428 flow [2021-03-26 08:38:39,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 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-26 08:38:39,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:39,256 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:39,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 08:38:39,256 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-26 08:38:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1193211806, now seen corresponding path program 1 times [2021-03-26 08:38:39,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:39,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994445687] [2021-03-26 08:38:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:39,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:39,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:39,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:39,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:39,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:39,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:39,277 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-26 08:38:39,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994445687] [2021-03-26 08:38:39,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:39,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 08:38:39,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009154151] [2021-03-26 08:38:39,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:38:39,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:38:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:38:39,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 304 [2021-03-26 08:38:39,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 176 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-26 08:38:39,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:39,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 304 [2021-03-26 08:38:39,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:39,547 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][135], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 138#L770-1true, Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 277#(= ~readerprogress2~0 0), 284#true, Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:39,547 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 08:38:39,547 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:39,547 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:39,547 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 08:38:39,627 INFO L129 PetriNetUnfolder]: 1650/4290 cut-off events. [2021-03-26 08:38:39,627 INFO L130 PetriNetUnfolder]: For 10794/11139 co-relation queries the response was YES. [2021-03-26 08:38:39,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14268 conditions, 4290 events. 1650/4290 cut-off events. For 10794/11139 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 40460 event pairs, 176 based on Foata normal form. 122/3725 useless extension candidates. Maximal degree in co-relation 13416. Up to 576 conditions per place. [2021-03-26 08:38:39,659 INFO L132 encePairwiseOnDemand]: 302/304 looper letters, 37 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2021-03-26 08:38:39,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1509 flow [2021-03-26 08:38:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:38:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:38:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2021-03-26 08:38:39,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8969298245614035 [2021-03-26 08:38:39,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 818 transitions. [2021-03-26 08:38:39,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 818 transitions. [2021-03-26 08:38:39,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:39,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 818 transitions. [2021-03-26 08:38:39,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-26 08:38:39,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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-26 08:38:39,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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-26 08:38:39,665 INFO L185 Difference]: Start difference. First operand has 119 places, 176 transitions, 1428 flow. Second operand 3 states and 818 transitions. [2021-03-26 08:38:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1509 flow [2021-03-26 08:38:39,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 177 transitions, 1501 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:39,719 INFO L241 Difference]: Finished difference. Result has 120 places, 169 transitions, 1387 flow [2021-03-26 08:38:39,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=120, PETRI_TRANSITIONS=169} [2021-03-26 08:38:39,719 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2021-03-26 08:38:39,719 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:39,720 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 169 transitions, 1387 flow [2021-03-26 08:38:39,720 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 169 transitions, 1387 flow [2021-03-26 08:38:39,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 169 transitions, 1387 flow [2021-03-26 08:38:39,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][102], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 135#L767-8true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 212#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 277#(= ~readerprogress2~0 0), 284#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 228#true, 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:39,795 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 08:38:39,795 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:39,795 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:39,795 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 08:38:39,884 INFO L129 PetriNetUnfolder]: 893/2755 cut-off events. [2021-03-26 08:38:39,884 INFO L130 PetriNetUnfolder]: For 7182/7440 co-relation queries the response was YES. [2021-03-26 08:38:39,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8607 conditions, 2755 events. 893/2755 cut-off events. For 7182/7440 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26531 event pairs, 46 based on Foata normal form. 74/2632 useless extension candidates. Maximal degree in co-relation 7693. Up to 340 conditions per place. [2021-03-26 08:38:39,918 INFO L142 LiptonReduction]: Number of co-enabled transitions 5588 [2021-03-26 08:38:40,975 INFO L154 LiptonReduction]: Checked pairs total: 1959 [2021-03-26 08:38:40,975 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:38:40,975 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1256 [2021-03-26 08:38:40,975 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 169 transitions, 1401 flow [2021-03-26 08:38:40,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-26 08:38:40,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:40,976 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:40,976 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 08:38:40,976 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-26 08:38:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1193212798, now seen corresponding path program 1 times [2021-03-26 08:38:40,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:40,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738317467] [2021-03-26 08:38:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:40,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:40,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:40,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:41,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:41,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:41,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:41,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:41,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:41,008 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-26 08:38:41,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738317467] [2021-03-26 08:38:41,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:41,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:38:41,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174928294] [2021-03-26 08:38:41,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:38:41,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:38:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:38:41,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 305 [2021-03-26 08:38:41,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 169 transitions, 1401 flow. Second operand has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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-26 08:38:41,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:41,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 305 [2021-03-26 08:38:41,011 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:41,383 INFO L129 PetriNetUnfolder]: 1142/3218 cut-off events. [2021-03-26 08:38:41,383 INFO L130 PetriNetUnfolder]: For 12449/13717 co-relation queries the response was YES. [2021-03-26 08:38:41,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10726 conditions, 3218 events. 1142/3218 cut-off events. For 12449/13717 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 30401 event pairs, 76 based on Foata normal form. 275/3249 useless extension candidates. Maximal degree in co-relation 9889. Up to 710 conditions per place. [2021-03-26 08:38:41,406 INFO L132 encePairwiseOnDemand]: 294/305 looper letters, 50 selfloop transitions, 29 changer transitions 0/206 dead transitions. [2021-03-26 08:38:41,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 206 transitions, 1800 flow [2021-03-26 08:38:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:38:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:38:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1823 transitions. [2021-03-26 08:38:41,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.853864168618267 [2021-03-26 08:38:41,411 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1823 transitions. [2021-03-26 08:38:41,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1823 transitions. [2021-03-26 08:38:41,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:41,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1823 transitions. [2021-03-26 08:38:41,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 260.42857142857144) internal successors, (1823), 7 states have internal predecessors, (1823), 0 states have call successors, (0), 0 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-26 08:38:41,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 305.0) internal successors, (2440), 8 states have internal predecessors, (2440), 0 states have call successors, (0), 0 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-26 08:38:41,417 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 305.0) internal successors, (2440), 8 states have internal predecessors, (2440), 0 states have call successors, (0), 0 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-26 08:38:41,418 INFO L185 Difference]: Start difference. First operand has 120 places, 169 transitions, 1401 flow. Second operand 7 states and 1823 transitions. [2021-03-26 08:38:41,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 206 transitions, 1800 flow [2021-03-26 08:38:41,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 206 transitions, 1785 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:38:41,452 INFO L241 Difference]: Finished difference. Result has 129 places, 185 transitions, 1644 flow [2021-03-26 08:38:41,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1644, PETRI_PLACES=129, PETRI_TRANSITIONS=185} [2021-03-26 08:38:41,452 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2021-03-26 08:38:41,452 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:41,452 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 185 transitions, 1644 flow [2021-03-26 08:38:41,452 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 185 transitions, 1644 flow [2021-03-26 08:38:41,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 185 transitions, 1644 flow [2021-03-26 08:38:41,611 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][60], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 261#(= ~readerprogress2~0 2), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 138#L770-1true, Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 277#(= ~readerprogress2~0 0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 288#true, Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 292#(<= 1 ~ctr2~0), Black: 228#true, Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:41,611 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 08:38:41,611 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:41,611 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:41,611 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 08:38:41,636 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][60], [256#(= ~readerprogress1~0 2), 193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 261#(= ~readerprogress2~0 2), 138#L770-1true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), Black: 206#true, 21#L786-2true, 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 277#(= ~readerprogress2~0 0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 288#true, Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 100#qrcu_reader1EXITtrue, 165#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 292#(<= 1 ~ctr2~0), Black: 228#true, Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 182#(= ~readerprogress1~0 0), Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 245#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:41,637 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 08:38:41,637 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 08:38:41,637 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 08:38:41,637 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 08:38:41,637 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 08:38:41,683 INFO L129 PetriNetUnfolder]: 1239/3647 cut-off events. [2021-03-26 08:38:41,683 INFO L130 PetriNetUnfolder]: For 13813/14660 co-relation queries the response was YES. [2021-03-26 08:38:41,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12646 conditions, 3647 events. 1239/3647 cut-off events. For 13813/14660 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 36691 event pairs, 49 based on Foata normal form. 106/3523 useless extension candidates. Maximal degree in co-relation 11564. Up to 436 conditions per place. [2021-03-26 08:38:41,733 INFO L142 LiptonReduction]: Number of co-enabled transitions 5664 [2021-03-26 08:38:42,806 INFO L154 LiptonReduction]: Checked pairs total: 1762 [2021-03-26 08:38:42,806 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:38:42,806 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1354 [2021-03-26 08:38:42,806 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 185 transitions, 1644 flow [2021-03-26 08:38:42,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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-26 08:38:42,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:42,807 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:42,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 08:38:42,807 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-26 08:38:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2076032612, now seen corresponding path program 1 times [2021-03-26 08:38:42,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:42,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377396720] [2021-03-26 08:38:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:42,835 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:42,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:42,841 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:42,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:42,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:42,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:42,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:42,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:42,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:42,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:42,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:42,887 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-26 08:38:42,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377396720] [2021-03-26 08:38:42,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:42,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:42,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95220367] [2021-03-26 08:38:42,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:38:42,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:42,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:38:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:38:42,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 305 [2021-03-26 08:38:42,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 185 transitions, 1644 flow. Second operand has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:42,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:42,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 305 [2021-03-26 08:38:42,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:44,442 INFO L129 PetriNetUnfolder]: 7103/12560 cut-off events. [2021-03-26 08:38:44,442 INFO L130 PetriNetUnfolder]: For 45536/45899 co-relation queries the response was YES. [2021-03-26 08:38:44,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50490 conditions, 12560 events. 7103/12560 cut-off events. For 45536/45899 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 102048 event pairs, 369 based on Foata normal form. 316/9718 useless extension candidates. Maximal degree in co-relation 48202. Up to 3493 conditions per place. [2021-03-26 08:38:44,516 INFO L132 encePairwiseOnDemand]: 276/305 looper letters, 155 selfloop transitions, 54 changer transitions 217/448 dead transitions. [2021-03-26 08:38:44,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 448 transitions, 4479 flow [2021-03-26 08:38:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-26 08:38:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-26 08:38:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2628 transitions. [2021-03-26 08:38:44,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6627994955863808 [2021-03-26 08:38:44,522 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2628 transitions. [2021-03-26 08:38:44,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2628 transitions. [2021-03-26 08:38:44,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:44,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2628 transitions. [2021-03-26 08:38:44,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 202.15384615384616) internal successors, (2628), 13 states have internal predecessors, (2628), 0 states have call successors, (0), 0 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-26 08:38:44,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 305.0) internal successors, (4270), 14 states have internal predecessors, (4270), 0 states have call successors, (0), 0 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-26 08:38:44,532 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 305.0) internal successors, (4270), 14 states have internal predecessors, (4270), 0 states have call successors, (0), 0 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-26 08:38:44,532 INFO L185 Difference]: Start difference. First operand has 129 places, 185 transitions, 1644 flow. Second operand 13 states and 2628 transitions. [2021-03-26 08:38:44,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 448 transitions, 4479 flow [2021-03-26 08:38:44,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 448 transitions, 4449 flow, removed 15 selfloop flow, removed 0 redundant places. [2021-03-26 08:38:44,882 INFO L241 Difference]: Finished difference. Result has 152 places, 140 transitions, 1286 flow [2021-03-26 08:38:44,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1286, PETRI_PLACES=152, PETRI_TRANSITIONS=140} [2021-03-26 08:38:44,883 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 74 predicate places. [2021-03-26 08:38:44,883 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:44,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 140 transitions, 1286 flow [2021-03-26 08:38:44,883 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 140 transitions, 1286 flow [2021-03-26 08:38:44,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 1286 flow [2021-03-26 08:38:44,915 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][135], [Black: 256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 140#L767-10true, 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, 21#L786-2true, Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 190#true, Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 303#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:44,915 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:44,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:44,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:44,915 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:44,920 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][135], [Black: 256#(= ~readerprogress1~0 2), 261#(= ~readerprogress2~0 2), 138#L770-1true, 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, 21#L786-2true, Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 190#true, Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 198#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 303#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 228#true, Black: 232#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), 110#qrcu_reader2EXITtrue, Black: 242#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 247#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0))]) [2021-03-26 08:38:44,920 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:38:44,920 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:44,920 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:44,921 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:38:44,986 INFO L129 PetriNetUnfolder]: 402/1288 cut-off events. [2021-03-26 08:38:44,986 INFO L130 PetriNetUnfolder]: For 5506/5593 co-relation queries the response was YES. [2021-03-26 08:38:44,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 1288 events. 402/1288 cut-off events. For 5506/5593 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10724 event pairs, 21 based on Foata normal form. 12/1201 useless extension candidates. Maximal degree in co-relation 4855. Up to 168 conditions per place. [2021-03-26 08:38:45,001 INFO L142 LiptonReduction]: Number of co-enabled transitions 2986 [2021-03-26 08:38:45,139 INFO L154 LiptonReduction]: Checked pairs total: 1945 [2021-03-26 08:38:45,140 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 08:38:45,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 257 [2021-03-26 08:38:45,140 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 139 transitions, 1285 flow [2021-03-26 08:38:45,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:45,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:45,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:45,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 08:38:45,141 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-26 08:38:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash -953538514, now seen corresponding path program 2 times [2021-03-26 08:38:45,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:45,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612905457] [2021-03-26 08:38:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:45,169 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:45,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:45,175 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:45,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:45,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:45,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:45,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:45,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:45,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:45,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:45,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:45,223 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-26 08:38:45,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612905457] [2021-03-26 08:38:45,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:45,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:45,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915944535] [2021-03-26 08:38:45,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:38:45,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:38:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:38:45,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 307 [2021-03-26 08:38:45,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 1285 flow. Second operand has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:45,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:45,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 307 [2021-03-26 08:38:45,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:45,795 INFO L129 PetriNetUnfolder]: 1293/2587 cut-off events. [2021-03-26 08:38:45,796 INFO L130 PetriNetUnfolder]: For 13871/13919 co-relation queries the response was YES. [2021-03-26 08:38:45,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 2587 events. 1293/2587 cut-off events. For 13871/13919 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17422 event pairs, 126 based on Foata normal form. 37/2143 useless extension candidates. Maximal degree in co-relation 12128. Up to 985 conditions per place. [2021-03-26 08:38:45,813 INFO L132 encePairwiseOnDemand]: 286/307 looper letters, 147 selfloop transitions, 66 changer transitions 26/260 dead transitions. [2021-03-26 08:38:45,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 260 transitions, 2834 flow [2021-03-26 08:38:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-26 08:38:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-26 08:38:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2919 transitions. [2021-03-26 08:38:45,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6338762214983713 [2021-03-26 08:38:45,819 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2919 transitions. [2021-03-26 08:38:45,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2919 transitions. [2021-03-26 08:38:45,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:45,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2919 transitions. [2021-03-26 08:38:45,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 194.6) internal successors, (2919), 15 states have internal predecessors, (2919), 0 states have call successors, (0), 0 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-26 08:38:45,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 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-26 08:38:45,830 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 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-26 08:38:45,830 INFO L185 Difference]: Start difference. First operand has 139 places, 139 transitions, 1285 flow. Second operand 15 states and 2919 transitions. [2021-03-26 08:38:45,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 260 transitions, 2834 flow [2021-03-26 08:38:45,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 260 transitions, 2567 flow, removed 107 selfloop flow, removed 14 redundant places. [2021-03-26 08:38:45,891 INFO L241 Difference]: Finished difference. Result has 144 places, 157 transitions, 1581 flow [2021-03-26 08:38:45,892 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1581, PETRI_PLACES=144, PETRI_TRANSITIONS=157} [2021-03-26 08:38:45,892 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 66 predicate places. [2021-03-26 08:38:45,892 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:45,892 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 157 transitions, 1581 flow [2021-03-26 08:38:45,892 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 157 transitions, 1581 flow [2021-03-26 08:38:45,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 157 transitions, 1581 flow [2021-03-26 08:38:45,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][149], [Black: 256#(= ~readerprogress1~0 2), Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), 261#(= ~readerprogress2~0 2), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 140#L767-10true, Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 264#true, Black: 303#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, Black: 206#true, 21#L786-2true, 344#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 336#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 340#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 343#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 350#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:45,923 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 08:38:45,923 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 08:38:45,923 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 08:38:45,923 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 08:38:45,929 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][149], [Black: 256#(= ~readerprogress1~0 2), Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), 261#(= ~readerprogress2~0 2), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 138#L770-1true, Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 264#true, Black: 303#true, Black: 266#(<= ~idx~0 0), 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, Black: 206#true, 21#L786-2true, 344#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 336#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 340#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 343#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 350#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-26 08:38:45,929 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 08:38:45,929 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:45,930 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:45,930 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 08:38:45,974 INFO L129 PetriNetUnfolder]: 357/1223 cut-off events. [2021-03-26 08:38:45,974 INFO L130 PetriNetUnfolder]: For 5698/5786 co-relation queries the response was YES. [2021-03-26 08:38:45,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 1223 events. 357/1223 cut-off events. For 5698/5786 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10256 event pairs, 24 based on Foata normal form. 31/1168 useless extension candidates. Maximal degree in co-relation 4501. Up to 149 conditions per place. [2021-03-26 08:38:45,989 INFO L142 LiptonReduction]: Number of co-enabled transitions 2770 [2021-03-26 08:38:46,097 INFO L154 LiptonReduction]: Checked pairs total: 2648 [2021-03-26 08:38:46,097 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:38:46,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 205 [2021-03-26 08:38:46,098 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 157 transitions, 1582 flow [2021-03-26 08:38:46,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:46,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:46,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:46,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 08:38:46,098 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-26 08:38:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1228998384, now seen corresponding path program 1 times [2021-03-26 08:38:46,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:46,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108060876] [2021-03-26 08:38:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:46,129 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:46,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:46,135 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:46,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:46,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:46,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:46,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:46,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:46,162 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 08:38:46,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:46,170 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 08:38:46,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:46,178 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-03-26 08:38:46,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:46,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:46,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:46,186 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-26 08:38:46,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108060876] [2021-03-26 08:38:46,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:46,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:46,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634301417] [2021-03-26 08:38:46,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:38:46,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:38:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:38:46,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 308 [2021-03-26 08:38:46,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 157 transitions, 1582 flow. Second operand has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:46,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:46,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 308 [2021-03-26 08:38:46,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:46,911 INFO L129 PetriNetUnfolder]: 1382/2701 cut-off events. [2021-03-26 08:38:46,911 INFO L130 PetriNetUnfolder]: For 14995/15038 co-relation queries the response was YES. [2021-03-26 08:38:46,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 2701 events. 1382/2701 cut-off events. For 14995/15038 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17908 event pairs, 145 based on Foata normal form. 38/2134 useless extension candidates. Maximal degree in co-relation 12460. Up to 901 conditions per place. [2021-03-26 08:38:46,937 INFO L132 encePairwiseOnDemand]: 287/308 looper letters, 168 selfloop transitions, 73 changer transitions 22/284 dead transitions. [2021-03-26 08:38:46,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 284 transitions, 3139 flow [2021-03-26 08:38:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-26 08:38:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-26 08:38:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2917 transitions. [2021-03-26 08:38:46,944 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6313852813852814 [2021-03-26 08:38:46,944 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2917 transitions. [2021-03-26 08:38:46,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2917 transitions. [2021-03-26 08:38:46,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:46,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2917 transitions. [2021-03-26 08:38:46,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 194.46666666666667) internal successors, (2917), 15 states have internal predecessors, (2917), 0 states have call successors, (0), 0 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-26 08:38:46,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 308.0) internal successors, (4928), 16 states have internal predecessors, (4928), 0 states have call successors, (0), 0 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-26 08:38:46,956 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 308.0) internal successors, (4928), 16 states have internal predecessors, (4928), 0 states have call successors, (0), 0 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-26 08:38:46,956 INFO L185 Difference]: Start difference. First operand has 144 places, 157 transitions, 1582 flow. Second operand 15 states and 2917 transitions. [2021-03-26 08:38:46,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 284 transitions, 3139 flow [2021-03-26 08:38:47,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 284 transitions, 2961 flow, removed 47 selfloop flow, removed 6 redundant places. [2021-03-26 08:38:47,031 INFO L241 Difference]: Finished difference. Result has 159 places, 183 transitions, 2006 flow [2021-03-26 08:38:47,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2006, PETRI_PLACES=159, PETRI_TRANSITIONS=183} [2021-03-26 08:38:47,031 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 81 predicate places. [2021-03-26 08:38:47,031 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:47,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 183 transitions, 2006 flow [2021-03-26 08:38:47,031 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 183 transitions, 2006 flow [2021-03-26 08:38:47,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 183 transitions, 2006 flow [2021-03-26 08:38:47,081 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][171], [Black: 256#(= ~readerprogress1~0 2), Black: 369#(and (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0)), 261#(= ~readerprogress2~0 2), Black: 372#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 381#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0)), Black: 365#true, Black: 383#(and (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 367#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), 140#L767-10true, 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, 21#L786-2true, Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 303#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 344#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 336#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 340#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 343#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 350#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 110#qrcu_reader2EXITtrue, 373#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-03-26 08:38:47,081 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-26 08:38:47,081 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 08:38:47,081 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 08:38:47,081 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-26 08:38:47,089 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L727-3-->L725-3: Formula: (and (= (ite (and (< 0 v_~ctr2~0_482) (<= 1 v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31)) 1 0) |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 |v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|) (= v_~ctr2~0_481 (+ v_~ctr2~0_482 1)) (not (= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 0)) (<= |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483647) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31) (not (= v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79 0)) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154) (<= 0 (+ |v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82| 2147483648))) InVars {qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_82|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_482} OutVars{qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond=v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond_79, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx_31, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond=|v_qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond_79|, qrcu_reader1Thread1of1ForFork0_#t~nondet12=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet12_81|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6_31|, qrcu_reader1Thread1of1ForFork0_#t~nondet11=|v_qrcu_reader1Thread1of1ForFork0_#t~nondet11_89|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_154, ~ctr2~0=v_~ctr2~0_481, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx_31|} AuxVars[] AssignedVars[qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx, qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_#in~cond, qrcu_reader1Thread1of1ForFork0_#t~nondet12, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6, qrcu_reader1Thread1of1ForFork0_#t~nondet11, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx][171], [Black: 256#(= ~readerprogress1~0 2), Black: 369#(and (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0)), 261#(= ~readerprogress2~0 2), Black: 372#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 381#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0)), Black: 365#true, Black: 383#(and (= ~ctr2~0 0) (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 138#L770-1true, Black: 367#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), 269#(and (<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0) (<= ~idx~0 0)), Black: 264#true, Black: 266#(<= ~idx~0 0), Black: 267#(<= qrcu_reader2Thread1of1ForFork1_~myidx~1 0), 275#true, 21#L786-2true, Black: 277#(= ~readerprogress2~0 0), Black: 278#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 292#(<= 1 ~ctr2~0), 165#true, 39#L725-3true, Black: 288#true, Black: 290#(= ~ctr2~0 0), Black: 291#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 296#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 311#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), Black: 305#(and (= ~ctr2~0 0) (<= ~idx~0 0) (= ~ctr1~0 1)), Black: 321#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 323#(and (= ~ctr2~0 0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 1 ~ctr1~0)), Black: 307#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 308#(and (= ~ctr2~0 0) (<= 1 ~ctr1~0)), Black: 309#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 192#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 315#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 317#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 319#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 303#true, 208#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 206#true, 344#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 217#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 212#true, Black: 215#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 219#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 221#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 336#true, 233#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 340#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 343#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 350#(and (<= qrcu_reader1Thread1of1ForFork0_~myidx~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 110#qrcu_reader2EXITtrue, 373#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)]) [2021-03-26 08:38:47,089 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-26 08:38:47,089 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:47,089 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:47,089 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-26 08:38:47,128 INFO L129 PetriNetUnfolder]: 443/1395 cut-off events. [2021-03-26 08:38:47,128 INFO L130 PetriNetUnfolder]: For 8941/9161 co-relation queries the response was YES. [2021-03-26 08:38:47,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6160 conditions, 1395 events. 443/1395 cut-off events. For 8941/9161 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11613 event pairs, 25 based on Foata normal form. 57/1315 useless extension candidates. Maximal degree in co-relation 6050. Up to 184 conditions per place. [2021-03-26 08:38:47,145 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-26 08:38:47,319 INFO L154 LiptonReduction]: Checked pairs total: 3117 [2021-03-26 08:38:47,319 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:38:47,320 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 289 [2021-03-26 08:38:47,320 INFO L480 AbstractCegarLoop]: Abstraction has has 159 places, 183 transitions, 2007 flow [2021-03-26 08:38:47,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:47,321 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:47,321 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:47,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 08:38:47,321 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-26 08:38:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 26501249, now seen corresponding path program 1 times [2021-03-26 08:38:47,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:47,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157157772] [2021-03-26 08:38:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:47,354 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:47,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:47,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:47,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 08:38:47,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 08:38:47,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 08:38:47,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:38:47,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:38:47,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:47,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:47,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:47,445 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-26 08:38:47,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157157772] [2021-03-26 08:38:47,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:47,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:38:47,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200892080] [2021-03-26 08:38:47,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:38:47,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:38:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:38:47,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 309 [2021-03-26 08:38:47,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 183 transitions, 2007 flow. Second operand has 10 states, 10 states have (on average 208.1) internal successors, (2081), 10 states have internal predecessors, (2081), 0 states have call successors, (0), 0 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-26 08:38:47,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:47,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 309 [2021-03-26 08:38:47,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:48,037 INFO L129 PetriNetUnfolder]: 677/1870 cut-off events. [2021-03-26 08:38:48,037 INFO L130 PetriNetUnfolder]: For 14679/14835 co-relation queries the response was YES. [2021-03-26 08:38:48,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9135 conditions, 1870 events. 677/1870 cut-off events. For 14679/14835 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15262 event pairs, 49 based on Foata normal form. 55/1756 useless extension candidates. Maximal degree in co-relation 8966. Up to 365 conditions per place. [2021-03-26 08:38:48,050 INFO L132 encePairwiseOnDemand]: 285/309 looper letters, 79 selfloop transitions, 85 changer transitions 32/260 dead transitions. [2021-03-26 08:38:48,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 260 transitions, 3313 flow [2021-03-26 08:38:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-26 08:38:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-26 08:38:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3440 transitions. [2021-03-26 08:38:48,053 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6957928802588996 [2021-03-26 08:38:48,053 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3440 transitions. [2021-03-26 08:38:48,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3440 transitions. [2021-03-26 08:38:48,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:48,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3440 transitions. [2021-03-26 08:38:48,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 215.0) internal successors, (3440), 16 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:38:48,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 309.0) internal successors, (5253), 17 states have internal predecessors, (5253), 0 states have call successors, (0), 0 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-26 08:38:48,062 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 309.0) internal successors, (5253), 17 states have internal predecessors, (5253), 0 states have call successors, (0), 0 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-26 08:38:48,063 INFO L185 Difference]: Start difference. First operand has 159 places, 183 transitions, 2007 flow. Second operand 16 states and 3440 transitions. [2021-03-26 08:38:48,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 260 transitions, 3313 flow [2021-03-26 08:38:48,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 260 transitions, 3107 flow, removed 89 selfloop flow, removed 4 redundant places. [2021-03-26 08:38:48,137 INFO L241 Difference]: Finished difference. Result has 179 places, 205 transitions, 2548 flow [2021-03-26 08:38:48,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2548, PETRI_PLACES=179, PETRI_TRANSITIONS=205} [2021-03-26 08:38:48,138 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 101 predicate places. [2021-03-26 08:38:48,138 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:48,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 205 transitions, 2548 flow [2021-03-26 08:38:48,138 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 205 transitions, 2548 flow [2021-03-26 08:38:48,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 205 transitions, 2548 flow [2021-03-26 08:38:48,282 INFO L129 PetriNetUnfolder]: 400/1335 cut-off events. [2021-03-26 08:38:48,283 INFO L130 PetriNetUnfolder]: For 11172/11328 co-relation queries the response was YES. [2021-03-26 08:38:48,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 1335 events. 400/1335 cut-off events. For 11172/11328 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11267 event pairs, 10 based on Foata normal form. 43/1250 useless extension candidates. Maximal degree in co-relation 6139. Up to 191 conditions per place. [2021-03-26 08:38:48,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 2932 [2021-03-26 08:38:48,437 INFO L154 LiptonReduction]: Checked pairs total: 3427 [2021-03-26 08:38:48,437 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:38:48,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 299 [2021-03-26 08:38:48,438 INFO L480 AbstractCegarLoop]: Abstraction has has 178 places, 204 transitions, 2544 flow [2021-03-26 08:38:48,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 208.1) internal successors, (2081), 10 states have internal predecessors, (2081), 0 states have call successors, (0), 0 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-26 08:38:48,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:48,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:48,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 08:38:48,439 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-26 08:38:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1473612857, now seen corresponding path program 2 times [2021-03-26 08:38:48,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:48,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110409929] [2021-03-26 08:38:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:48,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:48,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:48,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:48,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:38:48,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:48,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:48,490 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-26 08:38:48,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110409929] [2021-03-26 08:38:48,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:48,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:38:48,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862718046] [2021-03-26 08:38:48,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:48,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:48,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 310 [2021-03-26 08:38:48,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 204 transitions, 2544 flow. Second operand has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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-26 08:38:48,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:48,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 310 [2021-03-26 08:38:48,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:49,112 INFO L129 PetriNetUnfolder]: 1936/4865 cut-off events. [2021-03-26 08:38:49,112 INFO L130 PetriNetUnfolder]: For 39046/39457 co-relation queries the response was YES. [2021-03-26 08:38:49,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23590 conditions, 4865 events. 1936/4865 cut-off events. For 39046/39457 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45521 event pairs, 310 based on Foata normal form. 107/4470 useless extension candidates. Maximal degree in co-relation 22963. Up to 1000 conditions per place. [2021-03-26 08:38:49,155 INFO L132 encePairwiseOnDemand]: 300/310 looper letters, 39 selfloop transitions, 17 changer transitions 9/245 dead transitions. [2021-03-26 08:38:49,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 245 transitions, 2851 flow [2021-03-26 08:38:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:38:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:38:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2085 transitions. [2021-03-26 08:38:49,170 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7473118279569892 [2021-03-26 08:38:49,170 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2085 transitions. [2021-03-26 08:38:49,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2085 transitions. [2021-03-26 08:38:49,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:49,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2085 transitions. [2021-03-26 08:38:49,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 231.66666666666666) internal successors, (2085), 9 states have internal predecessors, (2085), 0 states have call successors, (0), 0 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-26 08:38:49,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 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-26 08:38:49,175 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 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-26 08:38:49,175 INFO L185 Difference]: Start difference. First operand has 178 places, 204 transitions, 2544 flow. Second operand 9 states and 2085 transitions. [2021-03-26 08:38:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 245 transitions, 2851 flow [2021-03-26 08:38:49,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 245 transitions, 2613 flow, removed 84 selfloop flow, removed 8 redundant places. [2021-03-26 08:38:49,499 INFO L241 Difference]: Finished difference. Result has 183 places, 216 transitions, 2456 flow [2021-03-26 08:38:49,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2456, PETRI_PLACES=183, PETRI_TRANSITIONS=216} [2021-03-26 08:38:49,499 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 105 predicate places. [2021-03-26 08:38:49,499 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:49,500 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 216 transitions, 2456 flow [2021-03-26 08:38:49,500 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 216 transitions, 2456 flow [2021-03-26 08:38:49,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 183 places, 216 transitions, 2456 flow [2021-03-26 08:38:49,625 INFO L129 PetriNetUnfolder]: 472/1696 cut-off events. [2021-03-26 08:38:49,625 INFO L130 PetriNetUnfolder]: For 10860/10979 co-relation queries the response was YES. [2021-03-26 08:38:49,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7542 conditions, 1696 events. 472/1696 cut-off events. For 10860/10979 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15622 event pairs, 11 based on Foata normal form. 37/1593 useless extension candidates. Maximal degree in co-relation 7336. Up to 174 conditions per place. [2021-03-26 08:38:49,649 INFO L142 LiptonReduction]: Number of co-enabled transitions 3078 [2021-03-26 08:38:50,010 INFO L154 LiptonReduction]: Checked pairs total: 1802 [2021-03-26 08:38:50,011 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 08:38:50,011 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 512 [2021-03-26 08:38:50,011 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 215 transitions, 2452 flow [2021-03-26 08:38:50,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 226.66666666666666) internal successors, (1360), 6 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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-26 08:38:50,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:50,012 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:50,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 08:38:50,012 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-26 08:38:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1947174269, now seen corresponding path program 1 times [2021-03-26 08:38:50,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:50,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348853725] [2021-03-26 08:38:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:50,038 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:50,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:50,044 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-26 08:38:50,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:50,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:50,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:50,059 INFO L142 QuantifierPusher]: treesize reduction 13, result has 35.0 percent of original size [2021-03-26 08:38:50,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:50,068 INFO L142 QuantifierPusher]: treesize reduction 13, result has 35.0 percent of original size [2021-03-26 08:38:50,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:50,078 INFO L142 QuantifierPusher]: treesize reduction 11, result has 67.6 percent of original size [2021-03-26 08:38:50,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 08:38:50,098 INFO L142 QuantifierPusher]: treesize reduction 11, result has 59.3 percent of original size [2021-03-26 08:38:50,099 INFO L147 QuantifierPusher]: treesize reduction 6, result has 62.5 percent of original size 10 [2021-03-26 08:38:50,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:50,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:50,113 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-26 08:38:50,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348853725] [2021-03-26 08:38:50,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:50,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:50,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149602934] [2021-03-26 08:38:50,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:38:50,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:38:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:38:50,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 312 [2021-03-26 08:38:50,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 215 transitions, 2452 flow. Second operand has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:50,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:50,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 312 [2021-03-26 08:38:50,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:50,831 INFO L129 PetriNetUnfolder]: 1512/3056 cut-off events. [2021-03-26 08:38:50,831 INFO L130 PetriNetUnfolder]: For 20130/20175 co-relation queries the response was YES. [2021-03-26 08:38:50,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16174 conditions, 3056 events. 1512/3056 cut-off events. For 20130/20175 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21593 event pairs, 71 based on Foata normal form. 56/2431 useless extension candidates. Maximal degree in co-relation 16010. Up to 842 conditions per place. [2021-03-26 08:38:50,853 INFO L132 encePairwiseOnDemand]: 288/312 looper letters, 158 selfloop transitions, 55 changer transitions 100/337 dead transitions. [2021-03-26 08:38:50,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 337 transitions, 4156 flow [2021-03-26 08:38:50,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-26 08:38:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-26 08:38:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2578 transitions. [2021-03-26 08:38:50,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6356015779092702 [2021-03-26 08:38:50,855 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2578 transitions. [2021-03-26 08:38:50,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2578 transitions. [2021-03-26 08:38:50,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:50,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2578 transitions. [2021-03-26 08:38:50,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 198.30769230769232) internal successors, (2578), 13 states have internal predecessors, (2578), 0 states have call successors, (0), 0 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-26 08:38:50,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 312.0) internal successors, (4368), 14 states have internal predecessors, (4368), 0 states have call successors, (0), 0 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-26 08:38:50,861 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 312.0) internal successors, (4368), 14 states have internal predecessors, (4368), 0 states have call successors, (0), 0 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-26 08:38:50,861 INFO L185 Difference]: Start difference. First operand has 182 places, 215 transitions, 2452 flow. Second operand 13 states and 2578 transitions. [2021-03-26 08:38:50,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 337 transitions, 4156 flow [2021-03-26 08:38:50,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 337 transitions, 4061 flow, removed 31 selfloop flow, removed 4 redundant places. [2021-03-26 08:38:50,974 INFO L241 Difference]: Finished difference. Result has 189 places, 164 transitions, 1797 flow [2021-03-26 08:38:50,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1797, PETRI_PLACES=189, PETRI_TRANSITIONS=164} [2021-03-26 08:38:50,975 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 111 predicate places. [2021-03-26 08:38:50,975 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:50,975 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 164 transitions, 1797 flow [2021-03-26 08:38:50,975 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 164 transitions, 1797 flow [2021-03-26 08:38:50,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 164 transitions, 1797 flow [2021-03-26 08:38:51,043 INFO L129 PetriNetUnfolder]: 223/921 cut-off events. [2021-03-26 08:38:51,043 INFO L130 PetriNetUnfolder]: For 5880/5939 co-relation queries the response was YES. [2021-03-26 08:38:51,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 921 events. 223/921 cut-off events. For 5880/5939 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7565 event pairs, 3 based on Foata normal form. 20/865 useless extension candidates. Maximal degree in co-relation 3910. Up to 101 conditions per place. [2021-03-26 08:38:51,053 INFO L142 LiptonReduction]: Number of co-enabled transitions 2002 [2021-03-26 08:38:51,605 INFO L154 LiptonReduction]: Checked pairs total: 2751 [2021-03-26 08:38:51,605 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 08:38:51,605 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 630 [2021-03-26 08:38:51,606 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 163 transitions, 1813 flow [2021-03-26 08:38:51,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.66666666666666) internal successors, (1662), 9 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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-26 08:38:51,606 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:51,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:51,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 08:38:51,607 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-26 08:38:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1950277450, now seen corresponding path program 1 times [2021-03-26 08:38:51,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:51,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818843405] [2021-03-26 08:38:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:51,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:51,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:51,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:51,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:51,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:51,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:51,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:38:51,658 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-26 08:38:51,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818843405] [2021-03-26 08:38:51,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:51,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:38:51,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215555538] [2021-03-26 08:38:51,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:51,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:51,660 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 321 [2021-03-26 08:38:51,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 163 transitions, 1813 flow. Second operand has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 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-26 08:38:51,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:51,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 321 [2021-03-26 08:38:51,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:51,922 INFO L129 PetriNetUnfolder]: 396/1150 cut-off events. [2021-03-26 08:38:51,923 INFO L130 PetriNetUnfolder]: For 9431/9528 co-relation queries the response was YES. [2021-03-26 08:38:51,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 1150 events. 396/1150 cut-off events. For 9431/9528 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8612 event pairs, 36 based on Foata normal form. 52/1019 useless extension candidates. Maximal degree in co-relation 5503. Up to 327 conditions per place. [2021-03-26 08:38:51,934 INFO L132 encePairwiseOnDemand]: 310/321 looper letters, 97 selfloop transitions, 21 changer transitions 16/203 dead transitions. [2021-03-26 08:38:51,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 203 transitions, 2428 flow [2021-03-26 08:38:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:38:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:38:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1417 transitions. [2021-03-26 08:38:51,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7357217030114226 [2021-03-26 08:38:51,936 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1417 transitions. [2021-03-26 08:38:51,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1417 transitions. [2021-03-26 08:38:51,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:51,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1417 transitions. [2021-03-26 08:38:51,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.16666666666666) internal successors, (1417), 6 states have internal predecessors, (1417), 0 states have call successors, (0), 0 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-26 08:38:51,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 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-26 08:38:51,939 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 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-26 08:38:51,939 INFO L185 Difference]: Start difference. First operand has 181 places, 163 transitions, 1813 flow. Second operand 6 states and 1417 transitions. [2021-03-26 08:38:51,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 203 transitions, 2428 flow [2021-03-26 08:38:51,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 203 transitions, 2204 flow, removed 24 selfloop flow, removed 19 redundant places. [2021-03-26 08:38:51,982 INFO L241 Difference]: Finished difference. Result has 168 places, 161 transitions, 1619 flow [2021-03-26 08:38:51,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1619, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2021-03-26 08:38:51,982 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 90 predicate places. [2021-03-26 08:38:51,982 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:51,982 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 161 transitions, 1619 flow [2021-03-26 08:38:51,983 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 161 transitions, 1619 flow [2021-03-26 08:38:51,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 161 transitions, 1619 flow [2021-03-26 08:38:52,050 INFO L129 PetriNetUnfolder]: 206/861 cut-off events. [2021-03-26 08:38:52,050 INFO L130 PetriNetUnfolder]: For 4705/4766 co-relation queries the response was YES. [2021-03-26 08:38:52,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 861 events. 206/861 cut-off events. For 4705/4766 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7031 event pairs, 2 based on Foata normal form. 26/808 useless extension candidates. Maximal degree in co-relation 3399. Up to 87 conditions per place. [2021-03-26 08:38:52,063 INFO L142 LiptonReduction]: Number of co-enabled transitions 1946 [2021-03-26 08:38:52,427 INFO L154 LiptonReduction]: Checked pairs total: 2441 [2021-03-26 08:38:52,427 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 08:38:52,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 445 [2021-03-26 08:38:52,428 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 1643 flow [2021-03-26 08:38:52,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 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-26 08:38:52,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:52,428 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:52,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 08:38:52,428 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-26 08:38:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1422837611, now seen corresponding path program 1 times [2021-03-26 08:38:52,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:52,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964548888] [2021-03-26 08:38:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:52,451 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:52,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:52,456 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:52,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:52,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:52,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:52,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:52,480 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-26 08:38:52,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:52,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:52,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:52,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:52,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:52,508 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-26 08:38:52,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964548888] [2021-03-26 08:38:52,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:52,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:38:52,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683348499] [2021-03-26 08:38:52,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:38:52,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:52,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:38:52,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:38:52,511 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 328 [2021-03-26 08:38:52,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 1643 flow. Second operand has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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-26 08:38:52,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:52,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 328 [2021-03-26 08:38:52,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:53,287 INFO L129 PetriNetUnfolder]: 1118/2540 cut-off events. [2021-03-26 08:38:53,287 INFO L130 PetriNetUnfolder]: For 15010/15054 co-relation queries the response was YES. [2021-03-26 08:38:53,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2540 events. 1118/2540 cut-off events. For 15010/15054 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19211 event pairs, 68 based on Foata normal form. 41/2180 useless extension candidates. Maximal degree in co-relation 11560. Up to 332 conditions per place. [2021-03-26 08:38:53,303 INFO L132 encePairwiseOnDemand]: 306/328 looper letters, 188 selfloop transitions, 111 changer transitions 108/429 dead transitions. [2021-03-26 08:38:53,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 429 transitions, 4704 flow [2021-03-26 08:38:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-03-26 08:38:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-03-26 08:38:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4672 transitions. [2021-03-26 08:38:53,306 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2021-03-26 08:38:53,306 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4672 transitions. [2021-03-26 08:38:53,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4672 transitions. [2021-03-26 08:38:53,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:53,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4672 transitions. [2021-03-26 08:38:53,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 194.66666666666666) internal successors, (4672), 24 states have internal predecessors, (4672), 0 states have call successors, (0), 0 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-26 08:38:53,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 328.0) internal successors, (8200), 25 states have internal predecessors, (8200), 0 states have call successors, (0), 0 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-26 08:38:53,315 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 328.0) internal successors, (8200), 25 states have internal predecessors, (8200), 0 states have call successors, (0), 0 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-26 08:38:53,315 INFO L185 Difference]: Start difference. First operand has 166 places, 160 transitions, 1643 flow. Second operand 24 states and 4672 transitions. [2021-03-26 08:38:53,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 429 transitions, 4704 flow [2021-03-26 08:38:53,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 429 transitions, 4450 flow, removed 23 selfloop flow, removed 8 redundant places. [2021-03-26 08:38:53,369 INFO L241 Difference]: Finished difference. Result has 192 places, 205 transitions, 2298 flow [2021-03-26 08:38:53,369 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2298, PETRI_PLACES=192, PETRI_TRANSITIONS=205} [2021-03-26 08:38:53,370 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 114 predicate places. [2021-03-26 08:38:53,370 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:53,370 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 205 transitions, 2298 flow [2021-03-26 08:38:53,370 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 205 transitions, 2298 flow [2021-03-26 08:38:53,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 205 transitions, 2298 flow [2021-03-26 08:38:53,445 INFO L129 PetriNetUnfolder]: 285/1060 cut-off events. [2021-03-26 08:38:53,446 INFO L130 PetriNetUnfolder]: For 7055/7155 co-relation queries the response was YES. [2021-03-26 08:38:53,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1060 events. 285/1060 cut-off events. For 7055/7155 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8863 event pairs, 3 based on Foata normal form. 22/993 useless extension candidates. Maximal degree in co-relation 4807. Up to 115 conditions per place. [2021-03-26 08:38:53,458 INFO L142 LiptonReduction]: Number of co-enabled transitions 2226 [2021-03-26 08:38:53,861 INFO L154 LiptonReduction]: Checked pairs total: 2494 [2021-03-26 08:38:53,861 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 08:38:53,861 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 491 [2021-03-26 08:38:53,861 INFO L480 AbstractCegarLoop]: Abstraction has has 187 places, 203 transitions, 2336 flow [2021-03-26 08:38:53,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 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-26 08:38:53,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:53,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:53,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 08:38:53,862 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-26 08:38:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 914097902, now seen corresponding path program 1 times [2021-03-26 08:38:53,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:53,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959467692] [2021-03-26 08:38:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:53,885 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:53,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:53,890 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:53,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:53,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:53,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:53,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:53,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:53,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:53,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:53,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:53,935 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-26 08:38:53,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959467692] [2021-03-26 08:38:53,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:53,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:53,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647810991] [2021-03-26 08:38:53,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:38:53,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:53,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:38:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:38:53,938 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 338 [2021-03-26 08:38:53,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 203 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 184.8) internal successors, (1848), 10 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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-26 08:38:53,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:53,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 338 [2021-03-26 08:38:53,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:54,601 INFO L129 PetriNetUnfolder]: 886/1972 cut-off events. [2021-03-26 08:38:54,601 INFO L130 PetriNetUnfolder]: For 16444/16520 co-relation queries the response was YES. [2021-03-26 08:38:54,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11049 conditions, 1972 events. 886/1972 cut-off events. For 16444/16520 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13755 event pairs, 87 based on Foata normal form. 62/1719 useless extension candidates. Maximal degree in co-relation 10881. Up to 341 conditions per place. [2021-03-26 08:38:54,621 INFO L132 encePairwiseOnDemand]: 309/338 looper letters, 195 selfloop transitions, 109 changer transitions 32/358 dead transitions. [2021-03-26 08:38:54,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 358 transitions, 4592 flow [2021-03-26 08:38:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-26 08:38:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-26 08:38:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3510 transitions. [2021-03-26 08:38:54,625 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2021-03-26 08:38:54,625 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3510 transitions. [2021-03-26 08:38:54,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3510 transitions. [2021-03-26 08:38:54,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:54,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3510 transitions. [2021-03-26 08:38:54,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 195.0) internal successors, (3510), 18 states have internal predecessors, (3510), 0 states have call successors, (0), 0 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-26 08:38:54,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 338.0) internal successors, (6422), 19 states have internal predecessors, (6422), 0 states have call successors, (0), 0 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-26 08:38:54,634 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 338.0) internal successors, (6422), 19 states have internal predecessors, (6422), 0 states have call successors, (0), 0 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-26 08:38:54,634 INFO L185 Difference]: Start difference. First operand has 187 places, 203 transitions, 2336 flow. Second operand 18 states and 3510 transitions. [2021-03-26 08:38:54,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 358 transitions, 4592 flow [2021-03-26 08:38:54,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 358 transitions, 4217 flow, removed 124 selfloop flow, removed 16 redundant places. [2021-03-26 08:38:54,730 INFO L241 Difference]: Finished difference. Result has 196 places, 218 transitions, 2542 flow [2021-03-26 08:38:54,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=2026, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2542, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2021-03-26 08:38:54,731 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 118 predicate places. [2021-03-26 08:38:54,731 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:54,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 218 transitions, 2542 flow [2021-03-26 08:38:54,732 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 218 transitions, 2542 flow [2021-03-26 08:38:54,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 196 places, 218 transitions, 2542 flow [2021-03-26 08:38:54,881 INFO L129 PetriNetUnfolder]: 285/1113 cut-off events. [2021-03-26 08:38:54,881 INFO L130 PetriNetUnfolder]: For 8198/8290 co-relation queries the response was YES. [2021-03-26 08:38:54,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 1113 events. 285/1113 cut-off events. For 8198/8290 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9452 event pairs, 3 based on Foata normal form. 13/1041 useless extension candidates. Maximal degree in co-relation 4852. Up to 113 conditions per place. [2021-03-26 08:38:54,897 INFO L142 LiptonReduction]: Number of co-enabled transitions 2310 [2021-03-26 08:38:55,071 INFO L154 LiptonReduction]: Checked pairs total: 2616 [2021-03-26 08:38:55,071 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 08:38:55,071 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 340 [2021-03-26 08:38:55,071 INFO L480 AbstractCegarLoop]: Abstraction has has 194 places, 216 transitions, 2532 flow [2021-03-26 08:38:55,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 184.8) internal successors, (1848), 10 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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-26 08:38:55,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:55,072 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:55,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 08:38:55,072 INFO L428 AbstractCegarLoop]: === Iteration 24 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:38:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1778569786, now seen corresponding path program 1 times [2021-03-26 08:38:55,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:55,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521305514] [2021-03-26 08:38:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:55,094 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:55,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,099 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:55,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:38:55,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521305514] [2021-03-26 08:38:55,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984193561] [2021-03-26 08:38:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 08:38:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:55,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjunts are in the unsatisfiable core [2021-03-26 08:38:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 08:38:55,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:55,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:38:55,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:38:55,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:55,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:38:55,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:55,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,434 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 08:38:55,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 08:38:55,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:38:55,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 08:38:55,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:38:55,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 08:38:55,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 08:38:55,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,470 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-03-26 08:38:55,470 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-03-26 08:38:55,474 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:38:55,477 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-03-26 08:38:55,478 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,478 INFO L142 QuantifierPusher]: treesize reduction 12, result has 40.0 percent of original size [2021-03-26 08:38:55,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:38:55,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:55,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:38:55,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:38:55,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,506 INFO L142 QuantifierPusher]: treesize reduction 1, result has 92.3 percent of original size [2021-03-26 08:38:55,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:38:55,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,508 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:38:55,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:38:55,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:55,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:55,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:55,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,523 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:38:55,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:55,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 08:38:55,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:38:55,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:55,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:38:55,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-26 08:38:55,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-03-26 08:38:55,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409130800] [2021-03-26 08:38:55,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:38:55,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:38:55,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:38:55,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 342 [2021-03-26 08:38:55,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 216 transitions, 2532 flow. Second operand has 11 states, 11 states have (on average 199.8181818181818) internal successors, (2198), 11 states have internal predecessors, (2198), 0 states have call successors, (0), 0 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-26 08:38:55,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:55,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 342 [2021-03-26 08:38:55,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:56,222 INFO L129 PetriNetUnfolder]: 649/1619 cut-off events. [2021-03-26 08:38:56,222 INFO L130 PetriNetUnfolder]: For 13836/13902 co-relation queries the response was YES. [2021-03-26 08:38:56,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9029 conditions, 1619 events. 649/1619 cut-off events. For 13836/13902 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11818 event pairs, 45 based on Foata normal form. 24/1393 useless extension candidates. Maximal degree in co-relation 8577. Up to 234 conditions per place. [2021-03-26 08:38:56,242 INFO L132 encePairwiseOnDemand]: 320/342 looper letters, 135 selfloop transitions, 90 changer transitions 33/290 dead transitions. [2021-03-26 08:38:56,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 290 transitions, 3842 flow [2021-03-26 08:38:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 08:38:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 08:38:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2318 transitions. [2021-03-26 08:38:56,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2021-03-26 08:38:56,245 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2318 transitions. [2021-03-26 08:38:56,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2318 transitions. [2021-03-26 08:38:56,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:56,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2318 transitions. [2021-03-26 08:38:56,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 210.72727272727272) internal successors, (2318), 11 states have internal predecessors, (2318), 0 states have call successors, (0), 0 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-26 08:38:56,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 342.0) internal successors, (4104), 12 states have internal predecessors, (4104), 0 states have call successors, (0), 0 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-26 08:38:56,251 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 342.0) internal successors, (4104), 12 states have internal predecessors, (4104), 0 states have call successors, (0), 0 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-26 08:38:56,251 INFO L185 Difference]: Start difference. First operand has 194 places, 216 transitions, 2532 flow. Second operand 11 states and 2318 transitions. [2021-03-26 08:38:56,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 290 transitions, 3842 flow [2021-03-26 08:38:56,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 290 transitions, 3692 flow, removed 22 selfloop flow, removed 11 redundant places. [2021-03-26 08:38:56,331 INFO L241 Difference]: Finished difference. Result has 195 places, 214 transitions, 2579 flow [2021-03-26 08:38:56,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=2395, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2579, PETRI_PLACES=195, PETRI_TRANSITIONS=214} [2021-03-26 08:38:56,332 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 117 predicate places. [2021-03-26 08:38:56,332 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:56,332 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 214 transitions, 2579 flow [2021-03-26 08:38:56,332 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 214 transitions, 2579 flow [2021-03-26 08:38:56,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 190 places, 214 transitions, 2579 flow [2021-03-26 08:38:56,480 INFO L129 PetriNetUnfolder]: 302/1043 cut-off events. [2021-03-26 08:38:56,480 INFO L130 PetriNetUnfolder]: For 8420/8508 co-relation queries the response was YES. [2021-03-26 08:38:56,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5275 conditions, 1043 events. 302/1043 cut-off events. For 8420/8508 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8363 event pairs, 3 based on Foata normal form. 15/957 useless extension candidates. Maximal degree in co-relation 4988. Up to 111 conditions per place. [2021-03-26 08:38:56,501 INFO L142 LiptonReduction]: Number of co-enabled transitions 2178 [2021-03-26 08:38:56,672 INFO L154 LiptonReduction]: Checked pairs total: 3112 [2021-03-26 08:38:56,672 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 08:38:56,672 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 340 [2021-03-26 08:38:56,673 INFO L480 AbstractCegarLoop]: Abstraction has has 190 places, 214 transitions, 2579 flow [2021-03-26 08:38:56,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 199.8181818181818) internal successors, (2198), 11 states have internal predecessors, (2198), 0 states have call successors, (0), 0 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-26 08:38:56,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:56,673 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:56,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-03-26 08:38:56,896 INFO L428 AbstractCegarLoop]: === Iteration 25 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:38:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 506061920, now seen corresponding path program 1 times [2021-03-26 08:38:56,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:56,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297198263] [2021-03-26 08:38:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:56,945 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:56,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:56,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:56,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:56,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:56,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:56,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:56,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:56,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:56,992 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-26 08:38:56,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297198263] [2021-03-26 08:38:56,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:56,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:38:56,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504573739] [2021-03-26 08:38:56,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:38:56,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:56,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:38:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:38:56,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 344 [2021-03-26 08:38:56,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 214 transitions, 2579 flow. Second operand has 9 states, 9 states have (on average 184.77777777777777) internal successors, (1663), 9 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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-26 08:38:56,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:56,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 344 [2021-03-26 08:38:56,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:57,751 INFO L129 PetriNetUnfolder]: 836/1849 cut-off events. [2021-03-26 08:38:57,751 INFO L130 PetriNetUnfolder]: For 15600/15641 co-relation queries the response was YES. [2021-03-26 08:38:57,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11081 conditions, 1849 events. 836/1849 cut-off events. For 15600/15641 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12537 event pairs, 56 based on Foata normal form. 24/1556 useless extension candidates. Maximal degree in co-relation 10515. Up to 332 conditions per place. [2021-03-26 08:38:57,773 INFO L132 encePairwiseOnDemand]: 314/344 looper letters, 174 selfloop transitions, 118 changer transitions 16/330 dead transitions. [2021-03-26 08:38:57,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 330 transitions, 4499 flow [2021-03-26 08:38:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-26 08:38:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-26 08:38:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3649 transitions. [2021-03-26 08:38:57,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5582925336597307 [2021-03-26 08:38:57,777 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3649 transitions. [2021-03-26 08:38:57,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3649 transitions. [2021-03-26 08:38:57,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:57,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3649 transitions. [2021-03-26 08:38:57,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 192.05263157894737) internal successors, (3649), 19 states have internal predecessors, (3649), 0 states have call successors, (0), 0 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-26 08:38:57,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 344.0) internal successors, (6880), 20 states have internal predecessors, (6880), 0 states have call successors, (0), 0 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-26 08:38:57,785 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 344.0) internal successors, (6880), 20 states have internal predecessors, (6880), 0 states have call successors, (0), 0 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-26 08:38:57,785 INFO L185 Difference]: Start difference. First operand has 190 places, 214 transitions, 2579 flow. Second operand 19 states and 3649 transitions. [2021-03-26 08:38:57,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 330 transitions, 4499 flow [2021-03-26 08:38:57,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 330 transitions, 4262 flow, removed 43 selfloop flow, removed 9 redundant places. [2021-03-26 08:38:57,871 INFO L241 Difference]: Finished difference. Result has 206 places, 242 transitions, 3172 flow [2021-03-26 08:38:57,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3172, PETRI_PLACES=206, PETRI_TRANSITIONS=242} [2021-03-26 08:38:57,871 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 128 predicate places. [2021-03-26 08:38:57,872 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:57,872 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 242 transitions, 3172 flow [2021-03-26 08:38:57,872 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 242 transitions, 3172 flow [2021-03-26 08:38:57,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 242 transitions, 3172 flow [2021-03-26 08:38:57,997 INFO L129 PetriNetUnfolder]: 324/1042 cut-off events. [2021-03-26 08:38:57,997 INFO L130 PetriNetUnfolder]: For 10052/10164 co-relation queries the response was YES. [2021-03-26 08:38:58,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1042 events. 324/1042 cut-off events. For 10052/10164 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8074 event pairs, 0 based on Foata normal form. 14/952 useless extension candidates. Maximal degree in co-relation 5623. Up to 117 conditions per place. [2021-03-26 08:38:58,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 2286 [2021-03-26 08:38:58,174 INFO L154 LiptonReduction]: Checked pairs total: 3578 [2021-03-26 08:38:58,174 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:38:58,175 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 303 [2021-03-26 08:38:58,176 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 242 transitions, 3182 flow [2021-03-26 08:38:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 184.77777777777777) internal successors, (1663), 9 states have internal predecessors, (1663), 0 states have call successors, (0), 0 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-26 08:38:58,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:58,176 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:58,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-26 08:38:58,176 INFO L428 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:38:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -369612869, now seen corresponding path program 1 times [2021-03-26 08:38:58,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:58,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012917943] [2021-03-26 08:38:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:58,213 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:58,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:58,218 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 08:38:58,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:58,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:58,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:58,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:58,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:58,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:38:58,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:58,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:58,268 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-26 08:38:58,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012917943] [2021-03-26 08:38:58,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:58,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:38:58,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460180603] [2021-03-26 08:38:58,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:38:58,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:38:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:38:58,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 345 [2021-03-26 08:38:58,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 242 transitions, 3182 flow. Second operand has 10 states, 10 states have (on average 184.7) internal successors, (1847), 10 states have internal predecessors, (1847), 0 states have call successors, (0), 0 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-26 08:38:58,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:58,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 345 [2021-03-26 08:38:58,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:58,941 INFO L129 PetriNetUnfolder]: 872/1940 cut-off events. [2021-03-26 08:38:58,941 INFO L130 PetriNetUnfolder]: For 18684/18774 co-relation queries the response was YES. [2021-03-26 08:38:58,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 1940 events. 872/1940 cut-off events. For 18684/18774 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13382 event pairs, 74 based on Foata normal form. 68/1692 useless extension candidates. Maximal degree in co-relation 11895. Up to 296 conditions per place. [2021-03-26 08:38:58,959 INFO L132 encePairwiseOnDemand]: 308/345 looper letters, 199 selfloop transitions, 145 changer transitions 35/401 dead transitions. [2021-03-26 08:38:58,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 401 transitions, 5838 flow [2021-03-26 08:38:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-26 08:38:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-26 08:38:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3690 transitions. [2021-03-26 08:38:58,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.562929061784897 [2021-03-26 08:38:58,981 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3690 transitions. [2021-03-26 08:38:58,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3690 transitions. [2021-03-26 08:38:58,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:58,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3690 transitions. [2021-03-26 08:38:58,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 194.21052631578948) internal successors, (3690), 19 states have internal predecessors, (3690), 0 states have call successors, (0), 0 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-26 08:38:58,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 345.0) internal successors, (6900), 20 states have internal predecessors, (6900), 0 states have call successors, (0), 0 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-26 08:38:58,989 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 345.0) internal successors, (6900), 20 states have internal predecessors, (6900), 0 states have call successors, (0), 0 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-26 08:38:58,989 INFO L185 Difference]: Start difference. First operand has 203 places, 242 transitions, 3182 flow. Second operand 19 states and 3690 transitions. [2021-03-26 08:38:58,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 401 transitions, 5838 flow [2021-03-26 08:38:59,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 401 transitions, 5664 flow, removed 50 selfloop flow, removed 11 redundant places. [2021-03-26 08:38:59,118 INFO L241 Difference]: Finished difference. Result has 217 places, 262 transitions, 3829 flow [2021-03-26 08:38:59,119 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=3062, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3829, PETRI_PLACES=217, PETRI_TRANSITIONS=262} [2021-03-26 08:38:59,119 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 139 predicate places. [2021-03-26 08:38:59,119 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:59,119 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 262 transitions, 3829 flow [2021-03-26 08:38:59,119 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 262 transitions, 3829 flow [2021-03-26 08:38:59,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 217 places, 262 transitions, 3829 flow [2021-03-26 08:38:59,256 INFO L129 PetriNetUnfolder]: 338/1115 cut-off events. [2021-03-26 08:38:59,256 INFO L130 PetriNetUnfolder]: For 12866/13014 co-relation queries the response was YES. [2021-03-26 08:38:59,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 1115 events. 338/1115 cut-off events. For 12866/13014 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8904 event pairs, 0 based on Foata normal form. 24/1038 useless extension candidates. Maximal degree in co-relation 6313. Up to 133 conditions per place. [2021-03-26 08:38:59,273 INFO L142 LiptonReduction]: Number of co-enabled transitions 2392 [2021-03-26 08:38:59,465 INFO L154 LiptonReduction]: Checked pairs total: 5039 [2021-03-26 08:38:59,465 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 08:38:59,465 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 346 [2021-03-26 08:38:59,465 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 262 transitions, 3829 flow [2021-03-26 08:38:59,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 184.7) internal successors, (1847), 10 states have internal predecessors, (1847), 0 states have call successors, (0), 0 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-26 08:38:59,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:38:59,466 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:38:59,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-26 08:38:59,466 INFO L428 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:38:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:38:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2013102547, now seen corresponding path program 1 times [2021-03-26 08:38:59,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:38:59,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278137613] [2021-03-26 08:38:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:38:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:38:59,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:59,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:59,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:59,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:38:59,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:59,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:59,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:38:59,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:38:59,508 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-26 08:38:59,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278137613] [2021-03-26 08:38:59,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:38:59,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:38:59,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170320082] [2021-03-26 08:38:59,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:38:59,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:38:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:38:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:38:59,510 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 348 [2021-03-26 08:38:59,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 262 transitions, 3829 flow. Second operand has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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-26 08:38:59,511 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:38:59,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 348 [2021-03-26 08:38:59,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:38:59,845 INFO L129 PetriNetUnfolder]: 544/1358 cut-off events. [2021-03-26 08:38:59,845 INFO L130 PetriNetUnfolder]: For 16458/16535 co-relation queries the response was YES. [2021-03-26 08:38:59,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8801 conditions, 1358 events. 544/1358 cut-off events. For 16458/16535 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9518 event pairs, 24 based on Foata normal form. 19/1166 useless extension candidates. Maximal degree in co-relation 8539. Up to 381 conditions per place. [2021-03-26 08:38:59,858 INFO L132 encePairwiseOnDemand]: 333/348 looper letters, 147 selfloop transitions, 54 changer transitions 16/294 dead transitions. [2021-03-26 08:38:59,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 294 transitions, 4661 flow [2021-03-26 08:38:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:38:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:38:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1194 transitions. [2021-03-26 08:38:59,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6862068965517242 [2021-03-26 08:38:59,860 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1194 transitions. [2021-03-26 08:38:59,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1194 transitions. [2021-03-26 08:38:59,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:38:59,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1194 transitions. [2021-03-26 08:38:59,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 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-26 08:38:59,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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-26 08:38:59,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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-26 08:38:59,863 INFO L185 Difference]: Start difference. First operand has 217 places, 262 transitions, 3829 flow. Second operand 5 states and 1194 transitions. [2021-03-26 08:38:59,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 294 transitions, 4661 flow [2021-03-26 08:38:59,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 294 transitions, 4520 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-03-26 08:38:59,962 INFO L241 Difference]: Finished difference. Result has 213 places, 257 transitions, 3802 flow [2021-03-26 08:38:59,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3802, PETRI_PLACES=213, PETRI_TRANSITIONS=257} [2021-03-26 08:38:59,962 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 135 predicate places. [2021-03-26 08:38:59,962 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:38:59,962 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 257 transitions, 3802 flow [2021-03-26 08:38:59,963 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 257 transitions, 3802 flow [2021-03-26 08:38:59,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 257 transitions, 3802 flow [2021-03-26 08:39:00,077 INFO L129 PetriNetUnfolder]: 329/1045 cut-off events. [2021-03-26 08:39:00,077 INFO L130 PetriNetUnfolder]: For 13218/13317 co-relation queries the response was YES. [2021-03-26 08:39:00,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 1045 events. 329/1045 cut-off events. For 13218/13317 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7991 event pairs, 0 based on Foata normal form. 17/947 useless extension candidates. Maximal degree in co-relation 6256. Up to 139 conditions per place. [2021-03-26 08:39:00,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 2382 [2021-03-26 08:39:00,128 INFO L154 LiptonReduction]: Checked pairs total: 1929 [2021-03-26 08:39:00,128 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:39:00,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-03-26 08:39:00,128 INFO L480 AbstractCegarLoop]: Abstraction has has 210 places, 257 transitions, 3802 flow [2021-03-26 08:39:00,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 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-26 08:39:00,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:39:00,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:39:00,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-26 08:39:00,129 INFO L428 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:39:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:39:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash -687466750, now seen corresponding path program 1 times [2021-03-26 08:39:00,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:39:00,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186004711] [2021-03-26 08:39:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:39:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:39:00,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:00,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:00,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:00,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:00,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:00,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:00,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:00,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:00,171 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-26 08:39:00,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186004711] [2021-03-26 08:39:00,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:39:00,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:39:00,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967309884] [2021-03-26 08:39:00,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:39:00,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:39:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:39:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:39:00,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 348 [2021-03-26 08:39:00,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 257 transitions, 3802 flow. Second operand has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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-26 08:39:00,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:39:00,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 348 [2021-03-26 08:39:00,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:39:00,437 INFO L129 PetriNetUnfolder]: 561/1330 cut-off events. [2021-03-26 08:39:00,437 INFO L130 PetriNetUnfolder]: For 17897/17970 co-relation queries the response was YES. [2021-03-26 08:39:00,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9055 conditions, 1330 events. 561/1330 cut-off events. For 17897/17970 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8784 event pairs, 26 based on Foata normal form. 20/1126 useless extension candidates. Maximal degree in co-relation 8898. Up to 416 conditions per place. [2021-03-26 08:39:00,449 INFO L132 encePairwiseOnDemand]: 333/348 looper letters, 140 selfloop transitions, 51 changer transitions 28/287 dead transitions. [2021-03-26 08:39:00,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 287 transitions, 4629 flow [2021-03-26 08:39:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:39:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:39:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1194 transitions. [2021-03-26 08:39:00,473 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6862068965517242 [2021-03-26 08:39:00,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1194 transitions. [2021-03-26 08:39:00,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1194 transitions. [2021-03-26 08:39:00,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:39:00,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1194 transitions. [2021-03-26 08:39:00,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 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-26 08:39:00,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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-26 08:39:00,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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-26 08:39:00,476 INFO L185 Difference]: Start difference. First operand has 210 places, 257 transitions, 3802 flow. Second operand 5 states and 1194 transitions. [2021-03-26 08:39:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 287 transitions, 4629 flow [2021-03-26 08:39:00,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 287 transitions, 4268 flow, removed 40 selfloop flow, removed 14 redundant places. [2021-03-26 08:39:00,566 INFO L241 Difference]: Finished difference. Result has 202 places, 245 transitions, 3423 flow [2021-03-26 08:39:00,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3423, PETRI_PLACES=202, PETRI_TRANSITIONS=245} [2021-03-26 08:39:00,566 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 124 predicate places. [2021-03-26 08:39:00,566 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:39:00,566 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 245 transitions, 3423 flow [2021-03-26 08:39:00,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 245 transitions, 3423 flow [2021-03-26 08:39:00,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 245 transitions, 3423 flow [2021-03-26 08:39:00,644 INFO L129 PetriNetUnfolder]: 311/942 cut-off events. [2021-03-26 08:39:00,644 INFO L130 PetriNetUnfolder]: For 11172/11244 co-relation queries the response was YES. [2021-03-26 08:39:00,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 942 events. 311/942 cut-off events. For 11172/11244 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6618 event pairs, 0 based on Foata normal form. 5/826 useless extension candidates. Maximal degree in co-relation 5436. Up to 134 conditions per place. [2021-03-26 08:39:00,655 INFO L142 LiptonReduction]: Number of co-enabled transitions 2272 [2021-03-26 08:39:00,986 INFO L154 LiptonReduction]: Checked pairs total: 5498 [2021-03-26 08:39:00,986 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 08:39:00,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 420 [2021-03-26 08:39:00,987 INFO L480 AbstractCegarLoop]: Abstraction has has 200 places, 245 transitions, 3455 flow [2021-03-26 08:39:00,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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-26 08:39:00,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:39:00,987 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:39:00,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-26 08:39:00,987 INFO L428 AbstractCegarLoop]: === Iteration 29 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:39:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:39:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash -541510721, now seen corresponding path program 1 times [2021-03-26 08:39:00,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:39:00,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992635900] [2021-03-26 08:39:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:39:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:39:01,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:01,045 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-26 08:39:01,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992635900] [2021-03-26 08:39:01,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:39:01,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:39:01,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013818968] [2021-03-26 08:39:01,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:39:01,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:39:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:39:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:39:01,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 357 [2021-03-26 08:39:01,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 245 transitions, 3455 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:01,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:39:01,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 357 [2021-03-26 08:39:01,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:39:01,367 INFO L129 PetriNetUnfolder]: 603/1357 cut-off events. [2021-03-26 08:39:01,367 INFO L130 PetriNetUnfolder]: For 16314/16393 co-relation queries the response was YES. [2021-03-26 08:39:01,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9059 conditions, 1357 events. 603/1357 cut-off events. For 16314/16393 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8776 event pairs, 31 based on Foata normal form. 13/1131 useless extension candidates. Maximal degree in co-relation 8891. Up to 393 conditions per place. [2021-03-26 08:39:01,376 INFO L132 encePairwiseOnDemand]: 345/357 looper letters, 86 selfloop transitions, 27 changer transitions 118/294 dead transitions. [2021-03-26 08:39:01,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 294 transitions, 4535 flow [2021-03-26 08:39:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:39:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:39:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1443 transitions. [2021-03-26 08:39:01,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6736694677871149 [2021-03-26 08:39:01,378 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1443 transitions. [2021-03-26 08:39:01,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1443 transitions. [2021-03-26 08:39:01,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:39:01,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1443 transitions. [2021-03-26 08:39:01,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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-26 08:39:01,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 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-26 08:39:01,381 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 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-26 08:39:01,381 INFO L185 Difference]: Start difference. First operand has 200 places, 245 transitions, 3455 flow. Second operand 6 states and 1443 transitions. [2021-03-26 08:39:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 294 transitions, 4535 flow [2021-03-26 08:39:01,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 294 transitions, 4120 flow, removed 19 selfloop flow, removed 18 redundant places. [2021-03-26 08:39:01,444 INFO L241 Difference]: Finished difference. Result has 187 places, 166 transitions, 2040 flow [2021-03-26 08:39:01,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=3060, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2040, PETRI_PLACES=187, PETRI_TRANSITIONS=166} [2021-03-26 08:39:01,444 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 109 predicate places. [2021-03-26 08:39:01,444 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:39:01,444 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 166 transitions, 2040 flow [2021-03-26 08:39:01,445 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 166 transitions, 2040 flow [2021-03-26 08:39:01,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 166 transitions, 2040 flow [2021-03-26 08:39:01,486 INFO L129 PetriNetUnfolder]: 147/574 cut-off events. [2021-03-26 08:39:01,486 INFO L130 PetriNetUnfolder]: For 4888/4903 co-relation queries the response was YES. [2021-03-26 08:39:01,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 574 events. 147/574 cut-off events. For 4888/4903 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3933 event pairs, 0 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 3038. Up to 65 conditions per place. [2021-03-26 08:39:01,492 INFO L142 LiptonReduction]: Number of co-enabled transitions 1522 [2021-03-26 08:39:01,737 INFO L154 LiptonReduction]: Checked pairs total: 3152 [2021-03-26 08:39:01,738 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 08:39:01,738 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 294 [2021-03-26 08:39:01,738 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 166 transitions, 2065 flow [2021-03-26 08:39:01,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:01,738 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:39:01,738 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:39:01,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-26 08:39:01,739 INFO L428 AbstractCegarLoop]: === Iteration 30 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:39:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:39:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1653425867, now seen corresponding path program 1 times [2021-03-26 08:39:01,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:39:01,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244745635] [2021-03-26 08:39:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:39:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:39:01,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:01,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:01,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:01,783 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-26 08:39:01,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244745635] [2021-03-26 08:39:01,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:39:01,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:39:01,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262595376] [2021-03-26 08:39:01,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:39:01,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:39:01,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:39:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:39:01,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 363 [2021-03-26 08:39:01,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 166 transitions, 2065 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:01,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:39:01,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 363 [2021-03-26 08:39:01,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:39:02,027 INFO L129 PetriNetUnfolder]: 280/746 cut-off events. [2021-03-26 08:39:02,027 INFO L130 PetriNetUnfolder]: For 7160/7183 co-relation queries the response was YES. [2021-03-26 08:39:02,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 746 events. 280/746 cut-off events. For 7160/7183 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4626 event pairs, 15 based on Foata normal form. 17/626 useless extension candidates. Maximal degree in co-relation 4695. Up to 179 conditions per place. [2021-03-26 08:39:02,034 INFO L132 encePairwiseOnDemand]: 347/363 looper letters, 54 selfloop transitions, 21 changer transitions 92/196 dead transitions. [2021-03-26 08:39:02,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 196 transitions, 2752 flow [2021-03-26 08:39:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:39:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:39:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1431 transitions. [2021-03-26 08:39:02,036 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6570247933884298 [2021-03-26 08:39:02,036 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1431 transitions. [2021-03-26 08:39:02,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1431 transitions. [2021-03-26 08:39:02,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:39:02,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1431 transitions. [2021-03-26 08:39:02,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 238.5) internal successors, (1431), 6 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:02,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 0 states have call successors, (0), 0 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-26 08:39:02,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 0 states have call successors, (0), 0 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-26 08:39:02,039 INFO L185 Difference]: Start difference. First operand has 181 places, 166 transitions, 2065 flow. Second operand 6 states and 1431 transitions. [2021-03-26 08:39:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 196 transitions, 2752 flow [2021-03-26 08:39:02,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 196 transitions, 2417 flow, removed 19 selfloop flow, removed 22 redundant places. [2021-03-26 08:39:02,069 INFO L241 Difference]: Finished difference. Result has 165 places, 89 transitions, 1006 flow [2021-03-26 08:39:02,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1006, PETRI_PLACES=165, PETRI_TRANSITIONS=89} [2021-03-26 08:39:02,069 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 87 predicate places. [2021-03-26 08:39:02,069 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:39:02,070 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 89 transitions, 1006 flow [2021-03-26 08:39:02,070 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 89 transitions, 1006 flow [2021-03-26 08:39:02,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 89 transitions, 1006 flow [2021-03-26 08:39:02,091 INFO L129 PetriNetUnfolder]: 63/231 cut-off events. [2021-03-26 08:39:02,091 INFO L130 PetriNetUnfolder]: For 1737/1775 co-relation queries the response was YES. [2021-03-26 08:39:02,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 231 events. 63/231 cut-off events. For 1737/1775 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1046 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 1249. Up to 53 conditions per place. [2021-03-26 08:39:02,093 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-26 08:39:03,330 INFO L154 LiptonReduction]: Checked pairs total: 338 [2021-03-26 08:39:03,330 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-26 08:39:03,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1262 [2021-03-26 08:39:03,331 INFO L480 AbstractCegarLoop]: Abstraction has has 140 places, 85 transitions, 1056 flow [2021-03-26 08:39:03,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:03,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:39:03,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:39:03,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-26 08:39:03,332 INFO L428 AbstractCegarLoop]: === Iteration 31 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-26 08:39:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:39:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 386872286, now seen corresponding path program 1 times [2021-03-26 08:39:03,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:39:03,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910706267] [2021-03-26 08:39:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:39:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:39:03,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:39:03,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910706267] [2021-03-26 08:39:03,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55142733] [2021-03-26 08:39:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 08:39:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:39:03,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2021-03-26 08:39:03,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-26 08:39:03,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:39:03,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:39:03,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 08:39:03,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 08:39:03,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:39:03,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,592 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.9 percent of original size [2021-03-26 08:39:03,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 08:39:03,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:39:03,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:39:03,609 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 08:39:03,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 08:39:03,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:39:03,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,616 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 08:39:03,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:39:03,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 08:39:03,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 08:39:03,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,634 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-03-26 08:39:03,634 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-03-26 08:39:03,634 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:39:03,636 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-03-26 08:39:03,637 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-26 08:39:03,637 INFO L142 QuantifierPusher]: treesize reduction 12, result has 40.0 percent of original size [2021-03-26 08:39:03,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:39:03,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:39:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-26 08:39:03,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-03-26 08:39:03,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-03-26 08:39:03,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439038578] [2021-03-26 08:39:03,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:39:03,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:39:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:39:03,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:39:03,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 380 [2021-03-26 08:39:03,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 85 transitions, 1056 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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-26 08:39:03,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:39:03,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 380 [2021-03-26 08:39:03,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:39:03,747 INFO L129 PetriNetUnfolder]: 110/263 cut-off events. [2021-03-26 08:39:03,748 INFO L130 PetriNetUnfolder]: For 2846/2847 co-relation queries the response was YES. [2021-03-26 08:39:03,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 263 events. 110/263 cut-off events. For 2846/2847 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1103 event pairs, 21 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 1809. Up to 142 conditions per place. [2021-03-26 08:39:03,750 INFO L132 encePairwiseOnDemand]: 369/380 looper letters, 0 selfloop transitions, 0 changer transitions 96/96 dead transitions. [2021-03-26 08:39:03,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 96 transitions, 1379 flow [2021-03-26 08:39:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:39:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:39:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1198 transitions. [2021-03-26 08:39:03,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6305263157894737 [2021-03-26 08:39:03,752 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1198 transitions. [2021-03-26 08:39:03,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1198 transitions. [2021-03-26 08:39:03,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:39:03,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1198 transitions. [2021-03-26 08:39:03,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:39:03,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-26 08:39:03,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-26 08:39:03,755 INFO L185 Difference]: Start difference. First operand has 140 places, 85 transitions, 1056 flow. Second operand 5 states and 1198 transitions. [2021-03-26 08:39:03,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 96 transitions, 1379 flow [2021-03-26 08:39:03,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 96 transitions, 952 flow, removed 74 selfloop flow, removed 37 redundant places. [2021-03-26 08:39:03,763 INFO L241 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2021-03-26 08:39:03,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=380, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2021-03-26 08:39:03,763 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2021-03-26 08:39:03,763 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:39:03,763 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 0 transitions, 0 flow [2021-03-26 08:39:03,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 0 transitions, 0 flow [2021-03-26 08:39:03,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-26 08:39:03,764 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-26 08:39:03,764 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 08:39:03,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-26 08:39:03,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-26 08:39:03,765 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:39:03,765 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:39:03,765 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2 [2021-03-26 08:39:03,767 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-26 08:39:03,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 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-26 08:39:03,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-26 08:39:03,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 08:39:03 BasicIcfg [2021-03-26 08:39:03,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 08:39:03,993 INFO L168 Benchmark]: Toolchain (without parser) took 49829.94 ms. Allocated memory was 255.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 235.1 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 373.6 MB. Max. memory is 16.0 GB. [2021-03-26 08:39:03,993 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.40 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 235.1 MB in the beginning and 304.6 MB in the end (delta: -69.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.04 ms. Allocated memory is still 343.9 MB. Free memory was 304.6 MB in the beginning and 301.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 INFO L168 Benchmark]: Boogie Preprocessor took 41.40 ms. Allocated memory is still 343.9 MB. Free memory was 301.9 MB in the beginning and 300.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 INFO L168 Benchmark]: RCFGBuilder took 1086.57 ms. Allocated memory is still 343.9 MB. Free memory was 299.8 MB in the beginning and 258.5 MB in the end (delta: 41.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 INFO L168 Benchmark]: TraceAbstraction took 48076.14 ms. Allocated memory was 343.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 257.6 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 309.4 MB. Max. memory is 16.0 GB. [2021-03-26 08:39:03,994 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.43 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 546.40 ms. Allocated memory was 255.9 MB in the beginning and 343.9 MB in the end (delta: 88.1 MB). Free memory was 235.1 MB in the beginning and 304.6 MB in the end (delta: -69.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.04 ms. Allocated memory is still 343.9 MB. Free memory was 304.6 MB in the beginning and 301.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.40 ms. Allocated memory is still 343.9 MB. Free memory was 301.9 MB in the beginning and 300.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1086.57 ms. Allocated memory is still 343.9 MB. Free memory was 299.8 MB in the beginning and 258.5 MB in the end (delta: 41.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 48076.14 ms. Allocated memory was 343.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 257.6 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 309.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4301.8ms, 147 PlacesBefore, 78 PlacesAfterwards, 159 TransitionsBefore, 86 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 85 TotalNumberOfCompositions, 12308 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6289, positive: 6127, positive conditional: 6127, positive unconditional: 0, negative: 162, negative conditional: 162, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6289, positive: 6127, positive conditional: 0, positive unconditional: 6127, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6289, positive: 6127, positive conditional: 0, positive unconditional: 6127, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4720, positive: 4636, positive conditional: 0, positive unconditional: 4636, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4720, positive: 4625, positive conditional: 0, positive unconditional: 4625, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 520, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 460, negative conditional: 0, negative unconditional: 460, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6289, positive: 1491, positive conditional: 0, positive unconditional: 1491, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 4720, unknown conditional: 0, unknown unconditional: 4720] , Statistics on independence cache: Total cache size (in pairs): 4720, Positive cache size: 4636, Positive conditional cache size: 0, Positive unconditional cache size: 4636, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1747.4ms, 82 PlacesBefore, 73 PlacesAfterwards, 104 TransitionsBefore, 95 TransitionsAfterwards, 4322 CoEnabledTransitionPairs, 5 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, 8618 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2060, positive: 1889, positive conditional: 1889, positive unconditional: 0, negative: 171, negative conditional: 171, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2060, positive: 1889, positive conditional: 221, positive unconditional: 1668, negative: 171, negative conditional: 17, negative unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2060, positive: 1889, positive conditional: 221, positive unconditional: 1668, negative: 171, negative conditional: 17, negative unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 841, positive: 808, positive conditional: 116, positive unconditional: 692, negative: 33, negative conditional: 4, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 841, positive: 800, positive conditional: 0, positive unconditional: 800, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 33, negative conditional: 4, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 214, negative conditional: 30, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2060, positive: 1081, positive conditional: 105, positive unconditional: 976, negative: 138, negative conditional: 13, negative unconditional: 125, unknown: 841, unknown conditional: 120, unknown unconditional: 721] , Statistics on independence cache: Total cache size (in pairs): 5561, Positive cache size: 5444, Positive conditional cache size: 116, Positive unconditional cache size: 5328, Negative cache size: 117, Negative conditional cache size: 4, Negative unconditional cache size: 113, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1863.0ms, 76 PlacesBefore, 70 PlacesAfterwards, 95 TransitionsBefore, 89 TransitionsAfterwards, 3716 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 4646 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1564, positive: 1472, positive conditional: 1472, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1564, positive: 1472, positive conditional: 232, positive unconditional: 1240, negative: 92, negative conditional: 9, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1564, positive: 1472, positive conditional: 232, positive unconditional: 1240, negative: 92, negative conditional: 9, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 358, positive: 345, positive conditional: 42, positive unconditional: 303, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 358, positive: 345, positive conditional: 0, positive unconditional: 345, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 83, negative conditional: 23, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1564, positive: 1127, positive conditional: 190, positive unconditional: 937, negative: 79, negative conditional: 8, negative unconditional: 71, unknown: 358, unknown conditional: 43, unknown unconditional: 315] , Statistics on independence cache: Total cache size (in pairs): 5919, Positive cache size: 5789, Positive conditional cache size: 158, Positive unconditional cache size: 5631, Negative cache size: 130, Negative conditional cache size: 5, Negative unconditional cache size: 125, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 248.3ms, 71 PlacesBefore, 71 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 3086 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 5178 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, positive: 852, positive conditional: 852, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 970, positive: 852, positive conditional: 112, positive unconditional: 740, negative: 118, negative conditional: 10, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 970, positive: 852, positive conditional: 112, positive unconditional: 740, negative: 118, negative conditional: 10, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 312, positive: 304, positive conditional: 50, positive unconditional: 254, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 312, positive: 303, positive conditional: 0, positive unconditional: 303, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 33, negative conditional: 12, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 970, positive: 548, positive conditional: 62, positive unconditional: 486, negative: 110, negative conditional: 9, negative unconditional: 101, unknown: 312, unknown conditional: 51, unknown unconditional: 261] , Statistics on independence cache: Total cache size (in pairs): 6231, Positive cache size: 6093, Positive conditional cache size: 208, Positive unconditional cache size: 5885, Negative cache size: 138, Negative conditional cache size: 6, Negative unconditional cache size: 132, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 157.2ms, 79 PlacesBefore, 79 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1664 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, positive: 262, positive conditional: 262, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 294, positive: 262, positive conditional: 37, positive unconditional: 225, negative: 32, negative conditional: 2, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 294, positive: 262, positive conditional: 37, positive unconditional: 225, negative: 32, negative conditional: 2, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, positive: 65, positive conditional: 12, positive unconditional: 53, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 294, positive: 197, positive conditional: 25, positive unconditional: 172, negative: 25, negative conditional: 2, negative unconditional: 23, unknown: 72, unknown conditional: 12, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 6303, Positive cache size: 6158, Positive conditional cache size: 220, Positive unconditional cache size: 5938, Negative cache size: 145, Negative conditional cache size: 6, Negative unconditional cache size: 139, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.6ms, 83 PlacesBefore, 83 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1680 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 283, positive conditional: 283, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 283, positive conditional: 42, positive unconditional: 241, negative: 32, negative conditional: 2, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 283, positive conditional: 42, positive unconditional: 241, negative: 32, negative conditional: 2, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 275, positive conditional: 42, positive unconditional: 233, negative: 32, negative conditional: 2, negative unconditional: 30, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 6311, Positive cache size: 6166, Positive conditional cache size: 220, Positive unconditional cache size: 5946, Negative cache size: 145, Negative conditional cache size: 6, Negative unconditional cache size: 139, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 238.6ms, 93 PlacesBefore, 93 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 4708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1526 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, positive: 115, positive conditional: 37, positive unconditional: 78, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, positive: 115, positive conditional: 37, positive unconditional: 78, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, positive: 102, positive conditional: 32, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 15, unknown conditional: 5, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 6326, Positive cache size: 6179, Positive conditional cache size: 225, Positive unconditional cache size: 5954, Negative cache size: 147, Negative conditional cache size: 6, Negative unconditional cache size: 141, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 255.5ms, 100 PlacesBefore, 100 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 4992 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1597 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, positive: 171, positive conditional: 171, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, positive: 171, positive conditional: 46, positive unconditional: 125, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 195, positive: 171, positive conditional: 46, positive unconditional: 125, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 1, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, positive: 165, positive conditional: 45, positive unconditional: 120, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6332, Positive cache size: 6185, Positive conditional cache size: 226, Positive unconditional cache size: 5959, Negative cache size: 147, Negative conditional cache size: 6, Negative unconditional cache size: 141, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 720.2ms, 106 PlacesBefore, 106 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1240 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, positive: 158, positive conditional: 158, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, positive: 158, positive conditional: 42, positive unconditional: 116, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 158, positive conditional: 42, positive unconditional: 116, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 156, positive conditional: 42, positive unconditional: 114, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6334, Positive cache size: 6187, Positive conditional cache size: 226, Positive unconditional cache size: 5961, Negative cache size: 147, Negative conditional cache size: 6, Negative unconditional cache size: 141, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 656.9ms, 109 PlacesBefore, 109 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1145 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, positive: 134, positive conditional: 134, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, positive: 134, positive conditional: 33, positive unconditional: 101, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 134, positive conditional: 33, positive unconditional: 101, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, positive: 134, positive conditional: 33, positive unconditional: 101, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6334, Positive cache size: 6187, Positive conditional cache size: 226, Positive unconditional cache size: 5961, Negative cache size: 147, Negative conditional cache size: 6, Negative unconditional cache size: 141, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 515.1ms, 111 PlacesBefore, 111 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1143 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, positive: 125, positive conditional: 125, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, positive: 125, positive conditional: 34, positive unconditional: 91, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 125, positive conditional: 34, positive unconditional: 91, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, positive: 123, positive conditional: 33, positive unconditional: 90, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6337, Positive cache size: 6189, Positive conditional cache size: 227, Positive unconditional cache size: 5962, Negative cache size: 148, Negative conditional cache size: 6, Negative unconditional cache size: 142, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2036.8ms, 114 PlacesBefore, 113 PlacesAfterwards, 171 TransitionsBefore, 170 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 2273 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 621, positive: 589, positive conditional: 589, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 621, positive: 589, positive conditional: 221, positive unconditional: 368, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 621, positive: 589, positive conditional: 221, positive unconditional: 368, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 162, positive: 160, positive conditional: 60, positive unconditional: 100, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 162, positive: 157, positive conditional: 0, positive unconditional: 157, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 621, positive: 429, positive conditional: 161, positive unconditional: 268, negative: 30, negative conditional: 2, negative unconditional: 28, unknown: 162, unknown conditional: 62, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 6499, Positive cache size: 6349, Positive conditional cache size: 287, Positive unconditional cache size: 6062, Negative cache size: 150, Negative conditional cache size: 8, Negative unconditional cache size: 142, Eliminated conditions: 85 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 935.2ms, 119 PlacesBefore, 119 PlacesAfterwards, 176 TransitionsBefore, 176 TransitionsAfterwards, 5966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1070 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, positive: 225, positive conditional: 225, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, positive: 225, positive conditional: 90, positive unconditional: 135, negative: 16, negative conditional: 2, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 225, positive conditional: 90, positive unconditional: 135, negative: 16, negative conditional: 2, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, positive: 223, positive conditional: 88, positive unconditional: 135, negative: 16, negative conditional: 2, negative unconditional: 14, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6501, Positive cache size: 6351, Positive conditional cache size: 289, Positive unconditional cache size: 6062, Negative cache size: 150, Negative conditional cache size: 8, Negative unconditional cache size: 142, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1255.2ms, 120 PlacesBefore, 120 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 5588 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1959 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 623, positive: 593, positive conditional: 593, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 623, positive: 593, positive conditional: 274, positive unconditional: 319, negative: 30, negative conditional: 4, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 623, positive: 593, positive conditional: 274, positive unconditional: 319, negative: 30, negative conditional: 4, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 37, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 623, positive: 512, positive conditional: 237, positive unconditional: 275, negative: 30, negative conditional: 4, negative unconditional: 26, unknown: 81, unknown conditional: 37, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 6582, Positive cache size: 6432, Positive conditional cache size: 326, Positive unconditional cache size: 6106, Negative cache size: 150, Negative conditional cache size: 8, Negative unconditional cache size: 142, Eliminated conditions: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1353.4ms, 129 PlacesBefore, 129 PlacesAfterwards, 185 TransitionsBefore, 185 TransitionsAfterwards, 5664 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1762 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, positive: 282, positive conditional: 282, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 306, positive: 282, positive conditional: 128, positive unconditional: 154, negative: 24, negative conditional: 3, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 306, positive: 282, positive conditional: 128, positive unconditional: 154, negative: 24, negative conditional: 3, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 306, positive: 264, positive conditional: 119, positive unconditional: 145, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 19, unknown conditional: 10, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 6601, Positive cache size: 6450, Positive conditional cache size: 335, Positive unconditional cache size: 6115, Negative cache size: 151, Negative conditional cache size: 9, Negative unconditional cache size: 142, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 256.5ms, 152 PlacesBefore, 139 PlacesAfterwards, 140 TransitionsBefore, 139 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1945 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 660, positive: 630, positive conditional: 630, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 662, positive: 630, positive conditional: 240, positive unconditional: 390, negative: 32, negative conditional: 6, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 662, positive: 630, positive conditional: 240, positive unconditional: 390, negative: 32, negative conditional: 6, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, positive: 58, positive conditional: 16, positive unconditional: 42, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 662, positive: 572, positive conditional: 224, positive unconditional: 348, negative: 31, negative conditional: 5, negative unconditional: 26, unknown: 59, unknown conditional: 17, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 6660, Positive cache size: 6508, Positive conditional cache size: 351, Positive unconditional cache size: 6157, Negative cache size: 152, Negative conditional cache size: 10, Negative unconditional cache size: 142, Eliminated conditions: 111 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 204.8ms, 144 PlacesBefore, 144 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 2770 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2648 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 828, positive: 788, positive conditional: 788, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 838, positive: 788, positive conditional: 326, positive unconditional: 462, negative: 50, negative conditional: 20, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 838, positive: 788, positive conditional: 326, positive unconditional: 462, negative: 50, negative conditional: 20, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 26, positive conditional: 3, positive unconditional: 23, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 19, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, positive: 762, positive conditional: 323, positive unconditional: 439, negative: 46, negative conditional: 17, negative unconditional: 29, unknown: 30, unknown conditional: 6, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 6690, Positive cache size: 6534, Positive conditional cache size: 354, Positive unconditional cache size: 6180, Negative cache size: 156, Negative conditional cache size: 13, Negative unconditional cache size: 143, Eliminated conditions: 184 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 288.2ms, 159 PlacesBefore, 159 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3117 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 882, positive: 838, positive conditional: 838, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 884, positive: 838, positive conditional: 376, positive unconditional: 462, negative: 46, negative conditional: 12, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 884, positive: 838, positive conditional: 376, positive unconditional: 462, negative: 46, negative conditional: 12, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 884, positive: 838, positive conditional: 376, positive unconditional: 462, negative: 46, negative conditional: 12, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6690, Positive cache size: 6534, Positive conditional cache size: 354, Positive unconditional cache size: 6180, Negative cache size: 156, Negative conditional cache size: 13, Negative unconditional cache size: 143, Eliminated conditions: 252 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 298.9ms, 179 PlacesBefore, 178 PlacesAfterwards, 205 TransitionsBefore, 204 TransitionsAfterwards, 2932 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3427 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 934, positive: 892, positive conditional: 892, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 936, positive: 892, positive conditional: 355, positive unconditional: 537, negative: 44, negative conditional: 2, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 936, positive: 892, positive conditional: 355, positive unconditional: 537, negative: 44, negative conditional: 2, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 936, positive: 883, positive conditional: 346, positive unconditional: 537, negative: 41, negative conditional: 2, negative unconditional: 39, unknown: 12, unknown conditional: 9, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 6702, Positive cache size: 6543, Positive conditional cache size: 363, Positive unconditional cache size: 6180, Negative cache size: 159, Negative conditional cache size: 13, Negative unconditional cache size: 146, Eliminated conditions: 274 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 510.8ms, 183 PlacesBefore, 182 PlacesAfterwards, 216 TransitionsBefore, 215 TransitionsAfterwards, 3078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1802 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, positive: 106, positive conditional: 49, positive unconditional: 57, negative: 24, negative conditional: 2, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 106, positive conditional: 49, positive unconditional: 57, negative: 24, negative conditional: 2, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 16, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, positive: 89, positive conditional: 33, positive unconditional: 56, negative: 24, negative conditional: 2, negative unconditional: 22, unknown: 17, unknown conditional: 16, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6719, Positive cache size: 6560, Positive conditional cache size: 379, Positive unconditional cache size: 6181, Negative cache size: 159, Negative conditional cache size: 13, Negative unconditional cache size: 146, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 630.3ms, 189 PlacesBefore, 181 PlacesAfterwards, 164 TransitionsBefore, 163 TransitionsAfterwards, 2002 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 2751 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 536, positive: 494, positive conditional: 494, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 539, positive: 494, positive conditional: 254, positive unconditional: 240, negative: 45, negative conditional: 27, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 539, positive: 494, positive conditional: 254, positive unconditional: 240, negative: 45, negative conditional: 27, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 48, positive conditional: 17, positive unconditional: 31, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 539, positive: 446, positive conditional: 237, positive unconditional: 209, negative: 44, negative conditional: 26, negative unconditional: 18, unknown: 49, unknown conditional: 18, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 6768, Positive cache size: 6608, Positive conditional cache size: 396, Positive unconditional cache size: 6212, Negative cache size: 160, Negative conditional cache size: 14, Negative unconditional cache size: 146, Eliminated conditions: 70 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 444.4ms, 168 PlacesBefore, 166 PlacesAfterwards, 161 TransitionsBefore, 160 TransitionsAfterwards, 1946 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 2441 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 276, positive conditional: 276, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, positive: 276, positive conditional: 167, positive unconditional: 109, negative: 54, negative conditional: 51, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 276, positive conditional: 167, positive unconditional: 109, negative: 54, negative conditional: 51, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 17, positive unconditional: 7, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, positive: 252, positive conditional: 150, positive unconditional: 102, negative: 51, negative conditional: 48, negative unconditional: 3, unknown: 27, unknown conditional: 20, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 6795, Positive cache size: 6632, Positive conditional cache size: 413, Positive unconditional cache size: 6219, Negative cache size: 163, Negative conditional cache size: 17, Negative unconditional cache size: 146, Eliminated conditions: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 491.0ms, 192 PlacesBefore, 187 PlacesAfterwards, 205 TransitionsBefore, 203 TransitionsAfterwards, 2226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2494 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 421, positive: 391, positive conditional: 391, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 433, positive: 391, positive conditional: 169, positive unconditional: 222, negative: 42, negative conditional: 12, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 433, positive: 391, positive conditional: 169, positive unconditional: 222, negative: 42, negative conditional: 12, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 66, positive: 64, positive conditional: 31, positive unconditional: 33, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 433, positive: 327, positive conditional: 138, positive unconditional: 189, negative: 40, negative conditional: 10, negative unconditional: 30, unknown: 66, unknown conditional: 33, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 6861, Positive cache size: 6696, Positive conditional cache size: 444, Positive unconditional cache size: 6252, Negative cache size: 165, Negative conditional cache size: 19, Negative unconditional cache size: 146, Eliminated conditions: 94 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 339.2ms, 196 PlacesBefore, 194 PlacesAfterwards, 218 TransitionsBefore, 216 TransitionsAfterwards, 2310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 2616 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 304, positive: 272, positive conditional: 272, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318, positive: 272, positive conditional: 149, positive unconditional: 123, negative: 46, negative conditional: 28, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318, positive: 272, positive conditional: 149, positive unconditional: 123, negative: 46, negative conditional: 28, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 318, positive: 263, positive conditional: 140, positive unconditional: 123, negative: 38, negative conditional: 20, negative unconditional: 18, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6878, Positive cache size: 6705, Positive conditional cache size: 453, Positive unconditional cache size: 6252, Negative cache size: 173, Negative conditional cache size: 27, Negative unconditional cache size: 146, Eliminated conditions: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 340.3ms, 195 PlacesBefore, 190 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 3112 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 287, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 251, positive conditional: 137, positive unconditional: 114, negative: 64, negative conditional: 28, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 251, positive conditional: 137, positive unconditional: 114, negative: 64, negative conditional: 28, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 250, positive conditional: 137, positive unconditional: 113, negative: 60, negative conditional: 24, negative unconditional: 36, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 6883, Positive cache size: 6706, Positive conditional cache size: 453, Positive unconditional cache size: 6253, Negative cache size: 177, Negative conditional cache size: 31, Negative unconditional cache size: 146, Eliminated conditions: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 302.3ms, 206 PlacesBefore, 203 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 2286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3578 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318, positive: 276, positive conditional: 276, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 378, positive: 276, positive conditional: 113, positive unconditional: 163, negative: 102, negative conditional: 80, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 378, positive: 276, positive conditional: 113, positive unconditional: 163, negative: 102, negative conditional: 80, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 378, positive: 272, positive conditional: 111, positive unconditional: 161, negative: 98, negative conditional: 76, negative unconditional: 22, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6891, Positive cache size: 6710, Positive conditional cache size: 455, Positive unconditional cache size: 6255, Negative cache size: 181, Negative conditional cache size: 35, Negative unconditional cache size: 146, Eliminated conditions: 119 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 345.4ms, 217 PlacesBefore, 217 PlacesAfterwards, 262 TransitionsBefore, 262 TransitionsAfterwards, 2392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 5039 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 583, positive: 533, positive conditional: 533, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 679, positive: 533, positive conditional: 202, positive unconditional: 331, negative: 146, negative conditional: 120, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 679, positive: 533, positive conditional: 202, positive unconditional: 331, negative: 146, negative conditional: 120, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 679, positive: 531, positive conditional: 202, positive unconditional: 329, negative: 138, negative conditional: 112, negative unconditional: 26, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6901, Positive cache size: 6712, Positive conditional cache size: 455, Positive unconditional cache size: 6257, Negative cache size: 189, Negative conditional cache size: 43, Negative unconditional cache size: 146, Eliminated conditions: 219 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 165.3ms, 213 PlacesBefore, 210 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 2382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1929 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 195, positive: 173, positive conditional: 173, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, positive: 173, positive conditional: 75, positive unconditional: 98, negative: 61, negative conditional: 52, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, positive: 173, positive conditional: 75, positive unconditional: 98, negative: 61, negative conditional: 52, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 234, positive: 171, positive conditional: 73, positive unconditional: 98, negative: 61, negative conditional: 52, negative unconditional: 9, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6903, Positive cache size: 6714, Positive conditional cache size: 457, Positive unconditional cache size: 6257, Negative cache size: 189, Negative conditional cache size: 43, Negative unconditional cache size: 146, Eliminated conditions: 67 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 419.5ms, 202 PlacesBefore, 200 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 2272 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 5498 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 698, positive: 638, positive conditional: 638, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 830, positive: 638, positive conditional: 284, positive unconditional: 354, negative: 192, negative conditional: 165, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 830, positive: 638, positive conditional: 284, positive unconditional: 354, negative: 192, negative conditional: 165, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 830, positive: 623, positive conditional: 275, positive unconditional: 348, negative: 182, negative conditional: 155, negative unconditional: 27, unknown: 25, unknown conditional: 19, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6928, Positive cache size: 6729, Positive conditional cache size: 466, Positive unconditional cache size: 6263, Negative cache size: 199, Negative conditional cache size: 53, Negative unconditional cache size: 146, Eliminated conditions: 196 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 292.9ms, 187 PlacesBefore, 181 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 1522 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 3152 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 606, positive: 534, positive conditional: 534, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 702, positive: 534, positive conditional: 315, positive unconditional: 219, negative: 168, negative conditional: 168, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 702, positive: 534, positive conditional: 315, positive unconditional: 219, negative: 168, negative conditional: 168, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 11, positive unconditional: 3, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 702, positive: 520, positive conditional: 304, positive unconditional: 216, negative: 164, negative conditional: 164, negative unconditional: 0, unknown: 18, unknown conditional: 15, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 6946, Positive cache size: 6743, Positive conditional cache size: 477, Positive unconditional cache size: 6266, Negative cache size: 203, Negative conditional cache size: 57, Negative unconditional cache size: 146, Eliminated conditions: 127 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1260.8ms, 165 PlacesBefore, 140 PlacesAfterwards, 89 TransitionsBefore, 85 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 338 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 208, positive: 197, positive conditional: 197, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, positive: 197, positive conditional: 45, positive unconditional: 152, negative: 41, negative conditional: 35, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, positive: 197, positive conditional: 45, positive unconditional: 152, negative: 41, negative conditional: 35, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 24, positive conditional: 11, positive unconditional: 13, negative: 25, negative conditional: 21, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 21, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 155, negative conditional: 137, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, positive: 173, positive conditional: 34, positive unconditional: 139, negative: 16, negative conditional: 14, negative unconditional: 2, unknown: 49, unknown conditional: 32, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 6995, Positive cache size: 6767, Positive conditional cache size: 488, Positive unconditional cache size: 6279, Negative cache size: 228, Negative conditional cache size: 78, Negative unconditional cache size: 150, Eliminated conditions: 78 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0ms, 106 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6995, Positive cache size: 6767, Positive conditional cache size: 488, Positive unconditional cache size: 6279, Negative cache size: 228, Negative conditional cache size: 78, Negative unconditional cache size: 150, Eliminated conditions: 0 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 47913.3ms, OverallIterations: 31, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 21355.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4385.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 958 SDtfs, 1867 SDslu, 1938 SDs, 0 SdLazy, 6832 SolverSat, 745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3576.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1876.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3829occurred in iteration=26, InterpolantAutomatonStates: 272, 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: 104.3ms SsaConstructionTime, 394.9ms SatisfiabilityAnalysisTime, 1994.4ms InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 3684 SizeOfPredicates, 19 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 33 InterpolantComputations, 30 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...