/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-RepeatedVariableLbe.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-25 03:17:05,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 03:17:05,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 03:17:05,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 03:17:05,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 03:17:05,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 03:17:05,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 03:17:05,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 03:17:05,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 03:17:05,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 03:17:05,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 03:17:05,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 03:17:05,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 03:17:05,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 03:17:05,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 03:17:05,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 03:17:05,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 03:17:05,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 03:17:05,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 03:17:05,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 03:17:05,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 03:17:05,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 03:17:05,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 03:17:05,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 03:17:05,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 03:17:05,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 03:17:05,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 03:17:05,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 03:17:05,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 03:17:05,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 03:17:05,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 03:17:05,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 03:17:05,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 03:17:05,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 03:17:05,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 03:17:05,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 03:17:05,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 03:17:05,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 03:17:05,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 03:17:05,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 03:17:05,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 03:17:05,942 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-RepeatedVariableLbe.epf [2021-03-25 03:17:05,976 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 03:17:05,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 03:17:05,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 03:17:05,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 03:17:05,979 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 03:17:05,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 03:17:05,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 03:17:05,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 03:17:05,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 03:17:05,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 03:17:05,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 03:17:05,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 03:17:05,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 03:17:05,982 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 03:17:05,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 03:17:05,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 03:17:05,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 03:17:05,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 03:17:05,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 03:17:05,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 03:17:05,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 03:17:05,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 03:17:05,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 03:17:05,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 03:17:05,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 03:17:05,985 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-25 03:17:06,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 03:17:06,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 03:17:06,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 03:17:06,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 03:17:06,327 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 03:17:06,328 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-25 03:17:06,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda8df4eb/bb3e9f67b57249ccb128a81ddc0b0fa6/FLAG7f7c1fa5f [2021-03-25 03:17:06,826 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 03:17:06,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-25 03:17:06,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda8df4eb/bb3e9f67b57249ccb128a81ddc0b0fa6/FLAG7f7c1fa5f [2021-03-25 03:17:07,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda8df4eb/bb3e9f67b57249ccb128a81ddc0b0fa6 [2021-03-25 03:17:07,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 03:17:07,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 03:17:07,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 03:17:07,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 03:17:07,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 03:17:07,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99949bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07, skipping insertion in model container [2021-03-25 03:17:07,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 03:17:07,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 03:17:07,548 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-25 03:17:07,552 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-25 03:17:07,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:17:07,581 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 03:17:07,617 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-25 03:17:07,618 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-25 03:17:07,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:17:07,686 INFO L208 MainTranslator]: Completed translation [2021-03-25 03:17:07,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07 WrapperNode [2021-03-25 03:17:07,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 03:17:07,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 03:17:07,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 03:17:07,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 03:17:07,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 03:17:07,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 03:17:07,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 03:17:07,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 03:17:07,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... [2021-03-25 03:17:07,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 03:17:07,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 03:17:07,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 03:17:07,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 03:17:07,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 03:17:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-03-25 03:17:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-03-25 03:17:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-03-25 03:17:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-03-25 03:17:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 03:17:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 03:17:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-03-25 03:17:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-03-25 03:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-03-25 03:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 03:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 03:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 03:17:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 03:17:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 03:17:07,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 03:17:08,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 03:17:08,698 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 03:17:08,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:17:08 BoogieIcfgContainer [2021-03-25 03:17:08,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 03:17:08,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 03:17:08,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 03:17:08,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 03:17:08,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:17:07" (1/3) ... [2021-03-25 03:17:08,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393be123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:17:08, skipping insertion in model container [2021-03-25 03:17:08,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:17:07" (2/3) ... [2021-03-25 03:17:08,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393be123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:17:08, skipping insertion in model container [2021-03-25 03:17:08,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:17:08" (3/3) ... [2021-03-25 03:17:08,705 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-03-25 03:17:08,710 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 03:17:08,714 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 03:17:08,714 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,746 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,747 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,748 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,748 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,748 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,748 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-25 03:17:08,748 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,748 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-25 03:17:08,748 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-25 03:17:08,749 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,749 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-25 03:17:08,749 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,749 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-25 03:17:08,749 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-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,750 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,751 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 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-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,752 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,753 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-25 03:17:08,753 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,753 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,753 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,753 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,753 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,754 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 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-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,755 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,756 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-25 03:17:08,756 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,756 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,756 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,756 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,756 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,757 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 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-25 03:17:08,758 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,758 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-25 03:17:08,758 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-25 03:17:08,759 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,759 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-25 03:17:08,759 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,759 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-25 03:17:08,759 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-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,760 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,761 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,761 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,761 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,774 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,775 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-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 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-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,776 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,777 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 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-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,778 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,779 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-25 03:17:08,779 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,780 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,781 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,782 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-25 03:17:08,782 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-25 03:17:08,782 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-25 03:17:08,782 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-25 03:17:08,783 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-25 03:17:08,783 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-25 03:17:08,783 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-25 03:17:08,783 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-25 03:17:08,783 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,783 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,783 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,783 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,783 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 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-25 03:17:08,784 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,784 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,784 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,785 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,786 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,787 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,788 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,789 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 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-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,790 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,791 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-25 03:17:08,791 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-25 03:17:08,791 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,791 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-25 03:17:08,791 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,791 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,791 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-25 03:17:08,791 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-25 03:17:08,792 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-25 03:17:08,792 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,792 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,792 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-25 03:17:08,792 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,792 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,792 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-25 03:17:08,792 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-25 03:17:08,793 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-25 03:17:08,793 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,793 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,793 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-25 03:17:08,793 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,793 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,793 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-25 03:17:08,793 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-25 03:17:08,793 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,794 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,795 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 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-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,796 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,797 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-25 03:17:08,797 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-25 03:17:08,797 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,797 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-25 03:17:08,797 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,797 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,797 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-25 03:17:08,797 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-25 03:17:08,797 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-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 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-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 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-25 03:17:08,798 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-25 03:17:08,798 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-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,798 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 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-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 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-25 03:17:08,799 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-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,799 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,800 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,801 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,802 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,804 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,804 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 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-25 03:17:08,805 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-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,805 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 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-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 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-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,806 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,808 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-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 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-25 03:17:08,809 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-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,809 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,810 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,810 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-25 03:17:08,811 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,811 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-25 03:17:08,811 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,811 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-25 03:17:08,811 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-25 03:17:08,811 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,811 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,811 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 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-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress1_~readerstart1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 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-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,812 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,813 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-25 03:17:08,813 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,813 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-25 03:17:08,813 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2___VERIFIER_atomic_check_progress2_~readerstart2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,813 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,813 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-25 03:17:08,813 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,813 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-25 03:17:08,813 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,814 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,814 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-25 03:17:08,814 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,814 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-25 03:17:08,814 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-25 03:17:08,814 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-25 03:17:08,814 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,814 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:17:08,821 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-25 03:17:08,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 03:17:08,852 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 03:17:08,852 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 03:17:08,852 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 03:17:08,852 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 03:17:08,852 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 03:17:08,852 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 03:17:08,852 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 03:17:08,852 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 03:17:08,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 03:17:08,915 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-03-25 03:17:08,916 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 03:17:08,925 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-25 03:17:08,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 03:17:08,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-03-25 03:17:08,932 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:08,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 03:17:08,942 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 03:17:08,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-03-25 03:17:08,973 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-03-25 03:17:08,973 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 03:17:08,975 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-25 03:17:08,981 INFO L142 LiptonReduction]: Number of co-enabled transitions 10120 [2021-03-25 03:17:12,667 INFO L154 LiptonReduction]: Checked pairs total: 12308 [2021-03-25 03:17:12,668 INFO L156 LiptonReduction]: Total number of compositions: 85 [2021-03-25 03:17:12,670 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3739 [2021-03-25 03:17:12,680 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2021-03-25 03:17:12,680 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 03:17:12,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:12,681 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:17:12,681 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-25 03:17:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 392022303, now seen corresponding path program 1 times [2021-03-25 03:17:12,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:12,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597899879] [2021-03-25 03:17:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:12,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:12,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:12,922 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:12,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:12,931 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:12,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:12,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:12,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:12,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:12,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:17:12,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597899879] [2021-03-25 03:17:12,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:12,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:17:12,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350712899] [2021-03-25 03:17:12,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:17:12,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:17:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:17:12,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 260 [2021-03-25 03:17:12,973 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-25 03:17:12,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:12,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 260 [2021-03-25 03:17:12,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:13,287 INFO L129 PetriNetUnfolder]: 467/1088 cut-off events. [2021-03-25 03:17:13,287 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2021-03-25 03:17:13,296 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-25 03:17:13,309 INFO L132 encePairwiseOnDemand]: 242/260 looper letters, 45 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2021-03-25 03:17:13,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 388 flow [2021-03-25 03:17:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:17:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:17:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2021-03-25 03:17:13,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7461538461538462 [2021-03-25 03:17:13,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1164 transitions. [2021-03-25 03:17:13,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1164 transitions. [2021-03-25 03:17:13,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:13,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1164 transitions. [2021-03-25 03:17:13,342 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-25 03:17:13,350 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-25 03:17:13,350 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-25 03:17:13,352 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 199 flow. Second operand 6 states and 1164 transitions. [2021-03-25 03:17:13,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 388 flow [2021-03-25 03:17:13,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 368 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 03:17:13,361 INFO L241 Difference]: Finished difference. Result has 82 places, 104 transitions, 339 flow [2021-03-25 03:17:13,363 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-25 03:17:13,363 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2021-03-25 03:17:13,364 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:13,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 03:17:13,365 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 03:17:13,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 104 transitions, 339 flow [2021-03-25 03:17:13,396 INFO L129 PetriNetUnfolder]: 100/433 cut-off events. [2021-03-25 03:17:13,396 INFO L130 PetriNetUnfolder]: For 105/116 co-relation queries the response was YES. [2021-03-25 03:17:13,398 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-25 03:17:13,405 INFO L142 LiptonReduction]: Number of co-enabled transitions 4322 [2021-03-25 03:17:14,783 INFO L154 LiptonReduction]: Checked pairs total: 8688 [2021-03-25 03:17:14,783 INFO L156 LiptonReduction]: Total number of compositions: 20 [2021-03-25 03:17:14,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1419 [2021-03-25 03:17:14,784 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 321 flow [2021-03-25 03:17:14,785 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-25 03:17:14,785 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:14,785 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:17:14,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 03:17:14,785 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-25 03:17:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -727867361, now seen corresponding path program 1 times [2021-03-25 03:17:14,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:14,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688805762] [2021-03-25 03:17:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:14,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:14,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:14,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:14,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:14,891 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-25 03:17:14,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688805762] [2021-03-25 03:17:14,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:14,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:14,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892061761] [2021-03-25 03:17:14,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:14,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:14,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 280 [2021-03-25 03:17:14,894 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-25 03:17:14,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:14,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 280 [2021-03-25 03:17:14,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:14,947 INFO L129 PetriNetUnfolder]: 113/447 cut-off events. [2021-03-25 03:17:14,947 INFO L130 PetriNetUnfolder]: For 105/112 co-relation queries the response was YES. [2021-03-25 03:17:14,949 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-25 03:17:14,952 INFO L132 encePairwiseOnDemand]: 277/280 looper letters, 6 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2021-03-25 03:17:14,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 341 flow [2021-03-25 03:17:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2021-03-25 03:17:14,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.925 [2021-03-25 03:17:14,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2021-03-25 03:17:14,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2021-03-25 03:17:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:14,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2021-03-25 03:17:14,957 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-25 03:17:14,959 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-25 03:17:14,959 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-25 03:17:14,959 INFO L185 Difference]: Start difference. First operand has 73 places, 95 transitions, 321 flow. Second operand 3 states and 777 transitions. [2021-03-25 03:17:14,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 341 flow [2021-03-25 03:17:14,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 03:17:14,963 INFO L241 Difference]: Finished difference. Result has 76 places, 95 transitions, 329 flow [2021-03-25 03:17:14,964 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-25 03:17:14,964 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2021-03-25 03:17:14,964 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:14,965 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 03:17:14,965 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 03:17:14,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 95 transitions, 329 flow [2021-03-25 03:17:14,992 INFO L129 PetriNetUnfolder]: 102/409 cut-off events. [2021-03-25 03:17:14,993 INFO L130 PetriNetUnfolder]: For 110/121 co-relation queries the response was YES. [2021-03-25 03:17:14,994 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-25 03:17:14,999 INFO L142 LiptonReduction]: Number of co-enabled transitions 3716 [2021-03-25 03:17:15,492 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 03:17:15,661 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 03:17:15,991 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 03:17:16,139 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 03:17:16,812 INFO L154 LiptonReduction]: Checked pairs total: 4646 [2021-03-25 03:17:16,812 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-25 03:17:16,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1848 [2021-03-25 03:17:16,813 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 317 flow [2021-03-25 03:17:16,814 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-25 03:17:16,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:16,814 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:17:16,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 03:17:16,814 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-25 03:17:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:16,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1127746976, now seen corresponding path program 1 times [2021-03-25 03:17:16,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:16,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208688476] [2021-03-25 03:17:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:16,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:16,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:16,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:16,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:16,891 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-25 03:17:16,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208688476] [2021-03-25 03:17:16,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:16,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:16,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740655861] [2021-03-25 03:17:16,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:16,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2021-03-25 03:17:16,893 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-25 03:17:16,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:16,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2021-03-25 03:17:16,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:16,962 INFO L129 PetriNetUnfolder]: 119/451 cut-off events. [2021-03-25 03:17:16,963 INFO L130 PetriNetUnfolder]: For 98/104 co-relation queries the response was YES. [2021-03-25 03:17:16,965 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-25 03:17:16,967 INFO L132 encePairwiseOnDemand]: 294/297 looper letters, 6 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-03-25 03:17:16,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 337 flow [2021-03-25 03:17:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2021-03-25 03:17:16,970 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2021-03-25 03:17:16,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2021-03-25 03:17:16,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2021-03-25 03:17:16,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:16,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2021-03-25 03:17:16,972 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-25 03:17:16,974 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-25 03:17:16,975 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-25 03:17:16,975 INFO L185 Difference]: Start difference. First operand has 70 places, 89 transitions, 317 flow. Second operand 3 states and 813 transitions. [2021-03-25 03:17:16,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 337 flow [2021-03-25 03:17:16,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:17:16,981 INFO L241 Difference]: Finished difference. Result has 71 places, 89 transitions, 321 flow [2021-03-25 03:17:16,981 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-25 03:17:16,981 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2021-03-25 03:17:16,982 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:16,982 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 03:17:16,982 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 03:17:16,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 321 flow [2021-03-25 03:17:17,008 INFO L129 PetriNetUnfolder]: 97/394 cut-off events. [2021-03-25 03:17:17,009 INFO L130 PetriNetUnfolder]: For 95/100 co-relation queries the response was YES. [2021-03-25 03:17:17,010 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-25 03:17:17,014 INFO L142 LiptonReduction]: Number of co-enabled transitions 3086 [2021-03-25 03:17:17,102 INFO L154 LiptonReduction]: Checked pairs total: 3736 [2021-03-25 03:17:17,102 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 03:17:17,102 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-25 03:17:17,103 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 321 flow [2021-03-25 03:17:17,104 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-25 03:17:17,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:17,104 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-25 03:17:17,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 03:17:17,104 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-25 03:17:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:17,105 INFO L82 PathProgramCache]: Analyzing trace with hash 274289960, now seen corresponding path program 1 times [2021-03-25 03:17:17,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:17,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456096877] [2021-03-25 03:17:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:17,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:17,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:17,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:17,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:17,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:17,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:17,204 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-25 03:17:17,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456096877] [2021-03-25 03:17:17,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:17,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 03:17:17,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146027411] [2021-03-25 03:17:17,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:17:17,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:17:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:17:17,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 301 [2021-03-25 03:17:17,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:17,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 301 [2021-03-25 03:17:17,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:17,426 INFO L129 PetriNetUnfolder]: 728/1758 cut-off events. [2021-03-25 03:17:17,426 INFO L130 PetriNetUnfolder]: For 437/598 co-relation queries the response was YES. [2021-03-25 03:17:17,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 1758 events. 728/1758 cut-off events. For 437/598 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13405 event pairs, 144 based on Foata normal form. 44/1639 useless extension candidates. Maximal degree in co-relation 2089. Up to 383 conditions per place. [2021-03-25 03:17:17,442 INFO L132 encePairwiseOnDemand]: 291/301 looper letters, 33 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2021-03-25 03:17:17,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 506 flow [2021-03-25 03:17:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:17:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:17:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1597 transitions. [2021-03-25 03:17:17,446 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7579496915045087 [2021-03-25 03:17:17,446 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1597 transitions. [2021-03-25 03:17:17,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1597 transitions. [2021-03-25 03:17:17,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:17,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1597 transitions. [2021-03-25 03:17:17,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 228.14285714285714) internal successors, (1597), 7 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,455 INFO L185 Difference]: Start difference. First operand has 71 places, 89 transitions, 321 flow. Second operand 7 states and 1597 transitions. [2021-03-25 03:17:17,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 506 flow [2021-03-25 03:17:17,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 122 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:17:17,461 INFO L241 Difference]: Finished difference. Result has 77 places, 104 transitions, 427 flow [2021-03-25 03:17:17,461 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=77, PETRI_TRANSITIONS=104} [2021-03-25 03:17:17,461 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2021-03-25 03:17:17,461 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:17,461 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 104 transitions, 427 flow [2021-03-25 03:17:17,462 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 104 transitions, 427 flow [2021-03-25 03:17:17,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 104 transitions, 427 flow [2021-03-25 03:17:17,497 INFO L129 PetriNetUnfolder]: 149/553 cut-off events. [2021-03-25 03:17:17,498 INFO L130 PetriNetUnfolder]: For 161/168 co-relation queries the response was YES. [2021-03-25 03:17:17,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 553 events. 149/553 cut-off events. For 161/168 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3916 event pairs, 3 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 861. Up to 54 conditions per place. [2021-03-25 03:17:17,506 INFO L142 LiptonReduction]: Number of co-enabled transitions 3518 [2021-03-25 03:17:17,526 INFO L154 LiptonReduction]: Checked pairs total: 1750 [2021-03-25 03:17:17,526 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:17,526 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 03:17:17,528 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 104 transitions, 427 flow [2021-03-25 03:17:17,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:17,529 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-25 03:17:17,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 03:17:17,529 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-25 03:17:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:17,529 INFO L82 PathProgramCache]: Analyzing trace with hash 324852874, now seen corresponding path program 1 times [2021-03-25 03:17:17,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:17,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012030165] [2021-03-25 03:17:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:17,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:17,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:17,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:17,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:17,591 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-25 03:17:17,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012030165] [2021-03-25 03:17:17,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:17,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:17,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552824123] [2021-03-25 03:17:17,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 03:17:17,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 03:17:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 03:17:17,593 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 301 [2021-03-25 03:17:17,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 104 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:17,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 301 [2021-03-25 03:17:17,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:17,891 INFO L129 PetriNetUnfolder]: 1080/2585 cut-off events. [2021-03-25 03:17:17,891 INFO L130 PetriNetUnfolder]: For 1616/1784 co-relation queries the response was YES. [2021-03-25 03:17:17,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 2585 events. 1080/2585 cut-off events. For 1616/1784 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20699 event pairs, 127 based on Foata normal form. 52/2422 useless extension candidates. Maximal degree in co-relation 4887. Up to 548 conditions per place. [2021-03-25 03:17:17,913 INFO L132 encePairwiseOnDemand]: 295/301 looper letters, 58 selfloop transitions, 12 changer transitions 2/146 dead transitions. [2021-03-25 03:17:17,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 758 flow [2021-03-25 03:17:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 03:17:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 03:17:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1159 transitions. [2021-03-25 03:17:17,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7700996677740863 [2021-03-25 03:17:17,917 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1159 transitions. [2021-03-25 03:17:17,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1159 transitions. [2021-03-25 03:17:17,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:17,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1159 transitions. [2021-03-25 03:17:17,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 231.8) internal successors, (1159), 5 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:17,924 INFO L185 Difference]: Start difference. First operand has 77 places, 104 transitions, 427 flow. Second operand 5 states and 1159 transitions. [2021-03-25 03:17:17,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 758 flow [2021-03-25 03:17:17,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 03:17:17,935 INFO L241 Difference]: Finished difference. Result has 84 places, 114 transitions, 537 flow [2021-03-25 03:17:17,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=84, PETRI_TRANSITIONS=114} [2021-03-25 03:17:17,935 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2021-03-25 03:17:17,935 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:17,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 114 transitions, 537 flow [2021-03-25 03:17:17,936 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 114 transitions, 537 flow [2021-03-25 03:17:17,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 114 transitions, 537 flow [2021-03-25 03:17:17,987 INFO L129 PetriNetUnfolder]: 204/775 cut-off events. [2021-03-25 03:17:17,987 INFO L130 PetriNetUnfolder]: For 293/315 co-relation queries the response was YES. [2021-03-25 03:17:17,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 775 events. 204/775 cut-off events. For 293/315 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6110 event pairs, 7 based on Foata normal form. 8/739 useless extension candidates. Maximal degree in co-relation 1255. Up to 80 conditions per place. [2021-03-25 03:17:17,999 INFO L142 LiptonReduction]: Number of co-enabled transitions 3678 [2021-03-25 03:17:18,039 INFO L154 LiptonReduction]: Checked pairs total: 1656 [2021-03-25 03:17:18,039 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:18,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-25 03:17:18,043 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 114 transitions, 537 flow [2021-03-25 03:17:18,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:18,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:17:18,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 03:17:18,044 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-25 03:17:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 744056357, now seen corresponding path program 1 times [2021-03-25 03:17:18,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:18,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065161763] [2021-03-25 03:17:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:18,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:18,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:17:18,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:18,080 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-25 03:17:18,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065161763] [2021-03-25 03:17:18,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:18,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 03:17:18,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141552850] [2021-03-25 03:17:18,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:18,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:18,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:18,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:18,083 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 301 [2021-03-25 03:17:18,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 114 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:18,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 301 [2021-03-25 03:17:18,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:18,178 INFO L129 PetriNetUnfolder]: 202/779 cut-off events. [2021-03-25 03:17:18,178 INFO L130 PetriNetUnfolder]: For 384/527 co-relation queries the response was YES. [2021-03-25 03:17:18,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 779 events. 202/779 cut-off events. For 384/527 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5961 event pairs, 10 based on Foata normal form. 29/771 useless extension candidates. Maximal degree in co-relation 1499. Up to 104 conditions per place. [2021-03-25 03:17:18,187 INFO L132 encePairwiseOnDemand]: 298/301 looper letters, 34 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2021-03-25 03:17:18,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 615 flow [2021-03-25 03:17:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2021-03-25 03:17:18,189 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8826135105204873 [2021-03-25 03:17:18,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2021-03-25 03:17:18,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2021-03-25 03:17:18,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:18,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2021-03-25 03:17:18,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,195 INFO L185 Difference]: Start difference. First operand has 84 places, 114 transitions, 537 flow. Second operand 3 states and 797 transitions. [2021-03-25 03:17:18,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 615 flow [2021-03-25 03:17:18,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 115 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 03:17:18,200 INFO L241 Difference]: Finished difference. Result has 88 places, 115 transitions, 559 flow [2021-03-25 03:17:18,200 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=559, PETRI_PLACES=88, PETRI_TRANSITIONS=115} [2021-03-25 03:17:18,200 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2021-03-25 03:17:18,200 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:18,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 115 transitions, 559 flow [2021-03-25 03:17:18,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 115 transitions, 559 flow [2021-03-25 03:17:18,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 115 transitions, 559 flow [2021-03-25 03:17:18,261 INFO L129 PetriNetUnfolder]: 206/797 cut-off events. [2021-03-25 03:17:18,261 INFO L130 PetriNetUnfolder]: For 414/434 co-relation queries the response was YES. [2021-03-25 03:17:18,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 797 events. 206/797 cut-off events. For 414/434 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6381 event pairs, 9 based on Foata normal form. 13/766 useless extension candidates. Maximal degree in co-relation 1349. Up to 82 conditions per place. [2021-03-25 03:17:18,275 INFO L142 LiptonReduction]: Number of co-enabled transitions 3732 [2021-03-25 03:17:18,312 INFO L154 LiptonReduction]: Checked pairs total: 1594 [2021-03-25 03:17:18,313 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:18,313 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 113 [2021-03-25 03:17:18,315 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 115 transitions, 559 flow [2021-03-25 03:17:18,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:18,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:18,315 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-25 03:17:18,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 03:17:18,315 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-25 03:17:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1679367001, now seen corresponding path program 1 times [2021-03-25 03:17:18,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:18,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617891900] [2021-03-25 03:17:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:18,365 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:18,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:18,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:18,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:18,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:18,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:18,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:18,385 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-25 03:17:18,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617891900] [2021-03-25 03:17:18,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:18,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:17:18,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529381040] [2021-03-25 03:17:18,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:17:18,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:18,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:17:18,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:17:18,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 301 [2021-03-25 03:17:18,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 115 transitions, 559 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-25 03:17:18,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:18,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 301 [2021-03-25 03:17:18,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:19,058 INFO L129 PetriNetUnfolder]: 1511/3217 cut-off events. [2021-03-25 03:17:19,058 INFO L130 PetriNetUnfolder]: For 3646/3672 co-relation queries the response was YES. [2021-03-25 03:17:19,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 3217 events. 1511/3217 cut-off events. For 3646/3672 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25868 event pairs, 32 based on Foata normal form. 122/3236 useless extension candidates. Maximal degree in co-relation 7721. Up to 847 conditions per place. [2021-03-25 03:17:19,091 INFO L132 encePairwiseOnDemand]: 275/301 looper letters, 138 selfloop transitions, 45 changer transitions 0/231 dead transitions. [2021-03-25 03:17:19,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 231 transitions, 1524 flow [2021-03-25 03:17:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:17:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:17:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2202 transitions. [2021-03-25 03:17:19,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7315614617940199 [2021-03-25 03:17:19,096 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2202 transitions. [2021-03-25 03:17:19,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2202 transitions. [2021-03-25 03:17:19,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:19,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2202 transitions. [2021-03-25 03:17:19,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 220.2) internal successors, (2202), 10 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:19,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 301.0) internal successors, (3311), 11 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:19,106 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 301.0) internal successors, (3311), 11 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:19,106 INFO L185 Difference]: Start difference. First operand has 88 places, 115 transitions, 559 flow. Second operand 10 states and 2202 transitions. [2021-03-25 03:17:19,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 231 transitions, 1524 flow [2021-03-25 03:17:19,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 231 transitions, 1504 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 03:17:19,121 INFO L241 Difference]: Finished difference. Result has 105 places, 154 transitions, 979 flow [2021-03-25 03:17:19,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=979, PETRI_PLACES=105, PETRI_TRANSITIONS=154} [2021-03-25 03:17:19,121 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2021-03-25 03:17:19,121 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:19,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 154 transitions, 979 flow [2021-03-25 03:17:19,122 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 154 transitions, 979 flow [2021-03-25 03:17:19,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 154 transitions, 979 flow [2021-03-25 03:17:19,214 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[][56], [Black: 192#(= ~readerprogress1~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)), 140#L767-10true, 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 190#true]) [2021-03-25 03:17:19,214 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 03:17:19,214 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:19,214 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:19,214 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:19,230 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) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45) (= |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|))) 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_45} 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_45} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][52], [Black: 192#(= ~readerprogress1~0 0), 138#L770-1true, Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 190#true]) [2021-03-25 03:17:19,230 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 03:17:19,230 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 03:17:19,230 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 03:17:19,231 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 03:17:19,268 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[][56], [Black: 192#(= ~readerprogress1~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)), 140#L767-10true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-25 03:17:19,268 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-25 03:17:19,268 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-25 03:17:19,268 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-25 03:17:19,268 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-25 03:17:19,270 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) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_45) (= |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|))) 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_45} 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_45} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][52], [138#L770-1true, Black: 192#(= ~readerprogress1~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)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-25 03:17:19,270 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 03:17:19,271 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:17:19,271 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:17:19,271 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 03:17:19,381 INFO L129 PetriNetUnfolder]: 780/2229 cut-off events. [2021-03-25 03:17:19,382 INFO L130 PetriNetUnfolder]: For 3445/3674 co-relation queries the response was YES. [2021-03-25 03:17:19,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 2229 events. 780/2229 cut-off events. For 3445/3674 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19819 event pairs, 16 based on Foata normal form. 35/2173 useless extension candidates. Maximal degree in co-relation 5410. Up to 313 conditions per place. [2021-03-25 03:17:19,422 INFO L142 LiptonReduction]: Number of co-enabled transitions 5094 [2021-03-25 03:17:19,805 INFO L154 LiptonReduction]: Checked pairs total: 1914 [2021-03-25 03:17:19,806 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:19,806 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 685 [2021-03-25 03:17:19,812 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 979 flow [2021-03-25 03:17:19,812 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-25 03:17:19,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:19,812 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-25 03:17:19,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 03:17:19,813 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-25 03:17:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1747754038, now seen corresponding path program 1 times [2021-03-25 03:17:19,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:19,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581954786] [2021-03-25 03:17:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:19,845 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:19,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:19,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:19,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:19,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:19,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:19,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:19,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:19,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:19,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:19,867 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-25 03:17:19,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581954786] [2021-03-25 03:17:19,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:19,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:17:19,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984763229] [2021-03-25 03:17:19,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:17:19,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:17:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:17:19,870 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 301 [2021-03-25 03:17:19,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 154 transitions, 979 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-25 03:17:19,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:19,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 301 [2021-03-25 03:17:19,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:20,603 INFO L129 PetriNetUnfolder]: 1740/3674 cut-off events. [2021-03-25 03:17:20,603 INFO L130 PetriNetUnfolder]: For 8937/8986 co-relation queries the response was YES. [2021-03-25 03:17:20,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12295 conditions, 3674 events. 1740/3674 cut-off events. For 8937/8986 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29499 event pairs, 77 based on Foata normal form. 110/3682 useless extension candidates. Maximal degree in co-relation 11655. Up to 1162 conditions per place. [2021-03-25 03:17:20,637 INFO L132 encePairwiseOnDemand]: 278/301 looper letters, 156 selfloop transitions, 64 changer transitions 0/268 dead transitions. [2021-03-25 03:17:20,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 268 transitions, 2189 flow [2021-03-25 03:17:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:17:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:17:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1986 transitions. [2021-03-25 03:17:20,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7331118493909191 [2021-03-25 03:17:20,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1986 transitions. [2021-03-25 03:17:20,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1986 transitions. [2021-03-25 03:17:20,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:20,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1986 transitions. [2021-03-25 03:17:20,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 220.66666666666666) internal successors, (1986), 9 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:20,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 301.0) internal successors, (3010), 10 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:20,653 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 301.0) internal successors, (3010), 10 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:20,653 INFO L185 Difference]: Start difference. First operand has 105 places, 154 transitions, 979 flow. Second operand 9 states and 1986 transitions. [2021-03-25 03:17:20,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 268 transitions, 2189 flow [2021-03-25 03:17:20,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 268 transitions, 2167 flow, removed 11 selfloop flow, removed 0 redundant places. [2021-03-25 03:17:20,676 INFO L241 Difference]: Finished difference. Result has 120 places, 194 transitions, 1570 flow [2021-03-25 03:17:20,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1570, PETRI_PLACES=120, PETRI_TRANSITIONS=194} [2021-03-25 03:17:20,676 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2021-03-25 03:17:20,677 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:20,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 194 transitions, 1570 flow [2021-03-25 03:17:20,677 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 194 transitions, 1570 flow [2021-03-25 03:17:20,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 194 transitions, 1570 flow [2021-03-25 03:17:20,758 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[][46], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, 39#L725-3true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,758 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][143], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,759 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][75], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,759 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,759 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,760 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,760 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:20,823 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[][46], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,824 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][143], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,824 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,824 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][75], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:20,825 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,825 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:20,958 INFO L129 PetriNetUnfolder]: 1137/2994 cut-off events. [2021-03-25 03:17:20,958 INFO L130 PetriNetUnfolder]: For 10540/10681 co-relation queries the response was YES. [2021-03-25 03:17:20,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9401 conditions, 2994 events. 1137/2994 cut-off events. For 10540/10681 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 27093 event pairs, 56 based on Foata normal form. 56/2913 useless extension candidates. Maximal degree in co-relation 8587. Up to 464 conditions per place. [2021-03-25 03:17:21,021 INFO L142 LiptonReduction]: Number of co-enabled transitions 6012 [2021-03-25 03:17:21,986 INFO L154 LiptonReduction]: Checked pairs total: 3653 [2021-03-25 03:17:21,986 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:21,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1309 [2021-03-25 03:17:21,987 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 194 transitions, 1570 flow [2021-03-25 03:17:21,987 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-25 03:17:21,987 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:21,988 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-25 03:17:21,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 03:17:21,988 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-25 03:17:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2050523745, now seen corresponding path program 1 times [2021-03-25 03:17:21,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:21,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663934862] [2021-03-25 03:17:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:22,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:22,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:22,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:22,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:22,020 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-25 03:17:22,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663934862] [2021-03-25 03:17:22,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:22,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:22,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423955616] [2021-03-25 03:17:22,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:22,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:22,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 301 [2021-03-25 03:17:22,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 194 transitions, 1570 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:22,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:22,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 301 [2021-03-25 03:17:22,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:22,219 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[][109], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,219 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,219 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,219 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][110], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,220 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][53], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,220 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,220 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,367 INFO L129 PetriNetUnfolder]: 1123/2982 cut-off events. [2021-03-25 03:17:22,368 INFO L130 PetriNetUnfolder]: For 10488/10656 co-relation queries the response was YES. [2021-03-25 03:17:22,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9575 conditions, 2982 events. 1123/2982 cut-off events. For 10488/10656 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26656 event pairs, 44 based on Foata normal form. 101/2967 useless extension candidates. Maximal degree in co-relation 8832. Up to 483 conditions per place. [2021-03-25 03:17:22,410 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 17 selfloop transitions, 1 changer transitions 0/198 dead transitions. [2021-03-25 03:17:22,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 198 transitions, 1634 flow [2021-03-25 03:17:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2021-03-25 03:17:22,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9269102990033222 [2021-03-25 03:17:22,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 837 transitions. [2021-03-25 03:17:22,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 837 transitions. [2021-03-25 03:17:22,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:22,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 837 transitions. [2021-03-25 03:17:22,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:22,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:22,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:22,419 INFO L185 Difference]: Start difference. First operand has 120 places, 194 transitions, 1570 flow. Second operand 3 states and 837 transitions. [2021-03-25 03:17:22,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 198 transitions, 1634 flow [2021-03-25 03:17:22,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 198 transitions, 1593 flow, removed 16 selfloop flow, removed 1 redundant places. [2021-03-25 03:17:22,451 INFO L241 Difference]: Finished difference. Result has 122 places, 194 transitions, 1534 flow [2021-03-25 03:17:22,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1534, PETRI_PLACES=122, PETRI_TRANSITIONS=194} [2021-03-25 03:17:22,451 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2021-03-25 03:17:22,451 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:22,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 194 transitions, 1534 flow [2021-03-25 03:17:22,452 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 194 transitions, 1534 flow [2021-03-25 03:17:22,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 194 transitions, 1534 flow [2021-03-25 03:17:22,526 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][141], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 268#true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,527 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][74], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 268#true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,527 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,527 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:22,544 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[][47], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 268#true, 140#L767-10true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, 39#L725-3true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,544 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 03:17:22,544 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:22,544 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:22,544 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:22,587 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[][47], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,587 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,587 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,587 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,587 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][141], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,588 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][74], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:22,588 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,588 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:22,710 INFO L129 PetriNetUnfolder]: 1155/3043 cut-off events. [2021-03-25 03:17:22,711 INFO L130 PetriNetUnfolder]: For 10385/10563 co-relation queries the response was YES. [2021-03-25 03:17:22,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 3043 events. 1155/3043 cut-off events. For 10385/10563 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 27552 event pairs, 53 based on Foata normal form. 67/2974 useless extension candidates. Maximal degree in co-relation 8738. Up to 500 conditions per place. [2021-03-25 03:17:22,773 INFO L142 LiptonReduction]: Number of co-enabled transitions 5988 [2021-03-25 03:17:23,650 INFO L154 LiptonReduction]: Checked pairs total: 3524 [2021-03-25 03:17:23,650 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:23,650 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1199 [2021-03-25 03:17:23,650 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 194 transitions, 1534 flow [2021-03-25 03:17:23,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:23,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:23,651 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-25 03:17:23,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 03:17:23,651 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-25 03:17:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 543509044, now seen corresponding path program 1 times [2021-03-25 03:17:23,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:23,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363880598] [2021-03-25 03:17:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:23,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:23,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:23,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:23,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:23,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-25 03:17:23,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363880598] [2021-03-25 03:17:23,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:23,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:23,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220972869] [2021-03-25 03:17:23,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:23,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:23,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:23,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 301 [2021-03-25 03:17:23,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 194 transitions, 1534 flow. Second operand has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:23,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:23,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 301 [2021-03-25 03:17:23,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:23,873 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[][109], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:23,874 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][110], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:23,874 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][51], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:23,874 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:23,875 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,031 INFO L129 PetriNetUnfolder]: 1133/3024 cut-off events. [2021-03-25 03:17:24,032 INFO L130 PetriNetUnfolder]: For 10380/10615 co-relation queries the response was YES. [2021-03-25 03:17:24,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9581 conditions, 3024 events. 1133/3024 cut-off events. For 10380/10615 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 27145 event pairs, 41 based on Foata normal form. 134/3043 useless extension candidates. Maximal degree in co-relation 8810. Up to 504 conditions per place. [2021-03-25 03:17:24,073 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 18 selfloop transitions, 1 changer transitions 0/198 dead transitions. [2021-03-25 03:17:24,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 198 transitions, 1598 flow [2021-03-25 03:17:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2021-03-25 03:17:24,076 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9136212624584718 [2021-03-25 03:17:24,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2021-03-25 03:17:24,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2021-03-25 03:17:24,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:24,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2021-03-25 03:17:24,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:24,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:24,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:24,081 INFO L185 Difference]: Start difference. First operand has 122 places, 194 transitions, 1534 flow. Second operand 3 states and 825 transitions. [2021-03-25 03:17:24,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 198 transitions, 1598 flow [2021-03-25 03:17:24,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 198 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 03:17:24,115 INFO L241 Difference]: Finished difference. Result has 124 places, 194 transitions, 1542 flow [2021-03-25 03:17:24,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1542, PETRI_PLACES=124, PETRI_TRANSITIONS=194} [2021-03-25 03:17:24,116 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2021-03-25 03:17:24,116 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:24,116 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 194 transitions, 1542 flow [2021-03-25 03:17:24,117 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 194 transitions, 1542 flow [2021-03-25 03:17:24,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 194 transitions, 1542 flow [2021-03-25 03:17:24,195 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][142], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,195 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,195 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,195 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,195 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,196 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][75], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 165#true, 39#L725-3true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,196 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,196 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,196 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,196 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:17:24,211 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[][47], [196#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, 39#L725-3true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,212 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 03:17:24,212 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:24,212 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:24,212 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:17:24,256 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[][47], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 140#L767-10true, 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,257 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_55 v_~ctr2~0_152) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_56 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_56, ~ctr2~0=v_~ctr2~0_152} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_55, ~ctr2~0=v_~ctr2~0_152} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][142], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), 135#L767-8true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,257 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,257 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,258 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_60 1) (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (= v_~ctr1~0_148 v_qrcu_updaterThread1of1ForFork2_~sum~0_59) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_60} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_148, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_59} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][75], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, Black: 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 220#true, 157#L767-4true, 100#qrcu_reader1EXITtrue, 165#true, Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 246#true, Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:24,258 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,258 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,258 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,258 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 03:17:24,421 INFO L129 PetriNetUnfolder]: 1171/3096 cut-off events. [2021-03-25 03:17:24,421 INFO L130 PetriNetUnfolder]: For 10473/10649 co-relation queries the response was YES. [2021-03-25 03:17:24,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9709 conditions, 3096 events. 1171/3096 cut-off events. For 10473/10649 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 28125 event pairs, 54 based on Foata normal form. 66/3028 useless extension candidates. Maximal degree in co-relation 8867. Up to 529 conditions per place. [2021-03-25 03:17:24,480 INFO L142 LiptonReduction]: Number of co-enabled transitions 5930 [2021-03-25 03:17:25,334 INFO L154 LiptonReduction]: Checked pairs total: 3512 [2021-03-25 03:17:25,334 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:25,334 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1218 [2021-03-25 03:17:25,335 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 194 transitions, 1542 flow [2021-03-25 03:17:25,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:25,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:25,335 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-25 03:17:25,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 03:17:25,336 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-25 03:17:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2047548884, now seen corresponding path program 1 times [2021-03-25 03:17:25,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:25,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931451874] [2021-03-25 03:17:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:25,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:25,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:25,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:25,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:25,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:25,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:25,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:25,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:25,374 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-25 03:17:25,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931451874] [2021-03-25 03:17:25,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:25,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 03:17:25,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356472504] [2021-03-25 03:17:25,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:17:25,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:17:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:17:25,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 301 [2021-03-25 03:17:25,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 194 transitions, 1542 flow. Second operand has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:25,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:25,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 301 [2021-03-25 03:17:25,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:26,218 INFO L129 PetriNetUnfolder]: 2333/5962 cut-off events. [2021-03-25 03:17:26,218 INFO L130 PetriNetUnfolder]: For 21641/22123 co-relation queries the response was YES. [2021-03-25 03:17:26,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20285 conditions, 5962 events. 2333/5962 cut-off events. For 21641/22123 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 60015 event pairs, 38 based on Foata normal form. 286/6061 useless extension candidates. Maximal degree in co-relation 18500. Up to 1212 conditions per place. [2021-03-25 03:17:26,276 INFO L132 encePairwiseOnDemand]: 290/301 looper letters, 75 selfloop transitions, 98 changer transitions 12/304 dead transitions. [2021-03-25 03:17:26,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 304 transitions, 2759 flow [2021-03-25 03:17:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:17:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:17:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1824 transitions. [2021-03-25 03:17:26,280 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8656858092074039 [2021-03-25 03:17:26,280 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1824 transitions. [2021-03-25 03:17:26,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1824 transitions. [2021-03-25 03:17:26,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:26,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1824 transitions. [2021-03-25 03:17:26,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 260.57142857142856) internal successors, (1824), 7 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-25 03:17:26,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:26,296 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 301.0) internal successors, (2408), 8 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:26,296 INFO L185 Difference]: Start difference. First operand has 124 places, 194 transitions, 1542 flow. Second operand 7 states and 1824 transitions. [2021-03-25 03:17:26,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 304 transitions, 2759 flow [2021-03-25 03:17:26,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 304 transitions, 2758 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 03:17:26,351 INFO L241 Difference]: Finished difference. Result has 134 places, 261 transitions, 2491 flow [2021-03-25 03:17:26,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2491, PETRI_PLACES=134, PETRI_TRANSITIONS=261} [2021-03-25 03:17:26,352 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2021-03-25 03:17:26,352 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:26,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 261 transitions, 2491 flow [2021-03-25 03:17:26,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 261 transitions, 2491 flow [2021-03-25 03:17:26,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 261 transitions, 2491 flow [2021-03-25 03:17:26,787 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][73], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 282#(<= 1 ~ctr2~0), Black: 214#true, Black: 280#(<= 0 ~ctr2~0), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:26,787 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][73], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 282#(<= 1 ~ctr2~0), Black: 280#(<= 0 ~ctr2~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:26,788 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,788 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,789 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][73], [259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 282#(<= 1 ~ctr2~0), Black: 280#(<= 0 ~ctr2~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-25 03:17:26,789 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,789 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,789 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,789 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,791 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][20], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 190#true, 62#L777true]) [2021-03-25 03:17:26,792 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,792 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,792 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,792 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,793 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([845] L773-2-->L773-2: Formula: (< 0 v_~ctr1~0_12) InVars {~ctr1~0=v_~ctr1~0_12} OutVars{~ctr1~0=v_~ctr1~0_12} AuxVars[] AssignedVars[][61], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 127#L773-2true]) [2021-03-25 03:17:26,793 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,793 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,793 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,793 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,793 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][121], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 204#true, 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:26,794 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,794 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,794 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,794 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([845] L773-2-->L773-2: Formula: (< 0 v_~ctr1~0_12) InVars {~ctr1~0=v_~ctr1~0_12} OutVars{~ctr1~0=v_~ctr1~0_12} AuxVars[] AssignedVars[][61], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 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: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 127#L773-2true]) [2021-03-25 03:17:26,795 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,795 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,795 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,795 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][121], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:26,795 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,796 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,796 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:26,796 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,797 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([845] L773-2-->L773-2: Formula: (< 0 v_~ctr1~0_12) InVars {~ctr1~0=v_~ctr1~0_12} OutVars{~ctr1~0=v_~ctr1~0_12} AuxVars[] AssignedVars[][61], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 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: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 190#true, 127#L773-2true]) [2021-03-25 03:17:26,797 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:26,797 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,797 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,797 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:26,811 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([939] L739-->qrcu_reader1EXIT: Formula: (and (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_7| v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_7) (= |v_qrcu_reader1Thread1of1ForFork0_#res.base_7| 0) (let ((.cse0 (<= v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_7 0))) (or (and (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_7| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_33|) (not .cse0) (= (+ v_~ctr2~0_146 1) v_~ctr2~0_147) (= v_~ctr1~0_135 v_~ctr1~0_134)) (and .cse0 (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_7| |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_33|) (= (+ v_~ctr1~0_134 1) v_~ctr1~0_135) (= v_~ctr2~0_147 v_~ctr2~0_146)))) (= |v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_7| v_qrcu_reader1Thread1of1ForFork0_~myidx~0_19) (= |v_qrcu_reader1Thread1of1ForFork0_#res.offset_7| 0)) InVars {~ctr1~0=v_~ctr1~0_135, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_19, ~ctr2~0=v_~ctr2~0_147} OutVars{qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8_7|, qrcu_reader1Thread1of1ForFork0_#res.offset=|v_qrcu_reader1Thread1of1ForFork0_#res.offset_7|, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx=v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx_7, ~ctr1~0=v_~ctr1~0_134, qrcu_reader1Thread1of1ForFork0_#res.base=|v_qrcu_reader1Thread1of1ForFork0_#res.base_7|, qrcu_reader1Thread1of1ForFork0_~myidx~0=v_qrcu_reader1Thread1of1ForFork0_~myidx~0_19, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx_7|, ~ctr2~0=v_~ctr2~0_146, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7=|v_qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7_7|} AuxVars[|v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post7_33|, |v_qrcu_reader1___VERIFIER_atomic_use_done_#t~post8_33|] AssignedVars[qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post8, qrcu_reader1Thread1of1ForFork0_#res.offset, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_~myidx, ~ctr1~0, qrcu_reader1Thread1of1ForFork0_#res.base, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#in~myidx, ~ctr2~0, qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use_done_#t~post7][112], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 192#(= ~readerprogress1~0 0), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 278#true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, Black: 280#(<= 0 ~ctr2~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 34#qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 190#true]) [2021-03-25 03:17:26,811 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,811 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2021-03-25 03:17:26,811 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,811 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:26,828 INFO L129 PetriNetUnfolder]: 2072/5587 cut-off events. [2021-03-25 03:17:26,828 INFO L130 PetriNetUnfolder]: For 22993/23439 co-relation queries the response was YES. [2021-03-25 03:17:26,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19556 conditions, 5587 events. 2072/5587 cut-off events. For 22993/23439 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 57988 event pairs, 58 based on Foata normal form. 172/5605 useless extension candidates. Maximal degree in co-relation 18137. Up to 1004 conditions per place. [2021-03-25 03:17:26,979 INFO L142 LiptonReduction]: Number of co-enabled transitions 7566 [2021-03-25 03:17:32,825 INFO L154 LiptonReduction]: Checked pairs total: 6979 [2021-03-25 03:17:32,825 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:32,825 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6473 [2021-03-25 03:17:32,826 INFO L480 AbstractCegarLoop]: Abstraction has has 134 places, 261 transitions, 2491 flow [2021-03-25 03:17:32,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:32,826 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:32,826 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-25 03:17:32,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 03:17:32,827 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-25 03:17:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1240925071, now seen corresponding path program 1 times [2021-03-25 03:17:32,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:32,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872188160] [2021-03-25 03:17:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:32,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:32,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:32,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:32,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:32,852 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-25 03:17:32,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872188160] [2021-03-25 03:17:32,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:32,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:17:32,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819614560] [2021-03-25 03:17:32,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:32,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:32,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 301 [2021-03-25 03:17:32,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 261 transitions, 2491 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:32,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:32,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 301 [2021-03-25 03:17:32,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:33,623 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([861] qrcu_reader2EXIT-->L788-2: Formula: (= v_qrcu_reader2Thread1of1ForFork1_thidvar0_6 |v_ULTIMATE.start_main_#t~mem28_7|) InVars {qrcu_reader2Thread1of1ForFork1_thidvar0=v_qrcu_reader2Thread1of1ForFork1_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_7|} OutVars{qrcu_reader2Thread1of1ForFork1_thidvar0=v_qrcu_reader2Thread1of1ForFork1_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_7|} AuxVars[] AssignedVars[][174], [192#(= ~readerprogress1~0 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, Black: 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 39#L725-3true, 295#(<= ~idx~0 0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 54#L788-2true, 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:33,623 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2021-03-25 03:17:33,623 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2021-03-25 03:17:33,623 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2021-03-25 03:17:33,623 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2021-03-25 03:17:33,628 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([862] qrcu_updaterEXIT-->L788-2: Formula: (= v_qrcu_updaterThread1of1ForFork2_thidvar0_6 |v_ULTIMATE.start_main_#t~mem28_9|) InVars {qrcu_updaterThread1of1ForFork2_thidvar0=v_qrcu_updaterThread1of1ForFork2_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_9|} OutVars{qrcu_updaterThread1of1ForFork2_thidvar0=v_qrcu_updaterThread1of1ForFork2_thidvar0_6, ULTIMATE.start_main_#t~mem28=|v_ULTIMATE.start_main_#t~mem28_9|} AuxVars[] AssignedVars[][202], [192#(= ~readerprogress1~0 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 204#true, Black: 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 39#L725-3true, 295#(<= ~idx~0 0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 54#L788-2true, 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:33,628 INFO L384 tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event [2021-03-25 03:17:33,628 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2021-03-25 03:17:33,628 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2021-03-25 03:17:33,628 INFO L387 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2021-03-25 03:17:33,639 INFO L129 PetriNetUnfolder]: 2604/7182 cut-off events. [2021-03-25 03:17:33,639 INFO L130 PetriNetUnfolder]: For 26860/27315 co-relation queries the response was YES. [2021-03-25 03:17:33,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24377 conditions, 7182 events. 2604/7182 cut-off events. For 26860/27315 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 76820 event pairs, 146 based on Foata normal form. 272/6836 useless extension candidates. Maximal degree in co-relation 22460. Up to 896 conditions per place. [2021-03-25 03:17:33,690 INFO L132 encePairwiseOnDemand]: 297/301 looper letters, 20 selfloop transitions, 5 changer transitions 9/257 dead transitions. [2021-03-25 03:17:33,691 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 257 transitions, 2482 flow [2021-03-25 03:17:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2021-03-25 03:17:33,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014396456256921 [2021-03-25 03:17:33,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 814 transitions. [2021-03-25 03:17:33,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 814 transitions. [2021-03-25 03:17:33,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:33,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 814 transitions. [2021-03-25 03:17:33,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:33,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:33,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:33,697 INFO L185 Difference]: Start difference. First operand has 134 places, 261 transitions, 2491 flow. Second operand 3 states and 814 transitions. [2021-03-25 03:17:33,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 257 transitions, 2482 flow [2021-03-25 03:17:33,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 257 transitions, 2450 flow, removed 16 selfloop flow, removed 0 redundant places. [2021-03-25 03:17:33,818 INFO L241 Difference]: Finished difference. Result has 132 places, 240 transitions, 2296 flow [2021-03-25 03:17:33,818 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=2384, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2296, PETRI_PLACES=132, PETRI_TRANSITIONS=240} [2021-03-25 03:17:33,818 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2021-03-25 03:17:33,818 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:33,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 240 transitions, 2296 flow [2021-03-25 03:17:33,819 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 240 transitions, 2296 flow [2021-03-25 03:17:33,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 240 transitions, 2296 flow [2021-03-25 03:17:34,264 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][67], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 282#(<= 1 ~ctr2~0), Black: 214#true, Black: 280#(<= 0 ~ctr2~0), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 293#true, 165#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:34,265 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:34,265 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,265 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,265 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,265 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][67], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 282#(<= 1 ~ctr2~0), Black: 280#(<= 0 ~ctr2~0), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 293#true, 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:34,265 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:34,265 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,266 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,266 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,270 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([845] L773-2-->L773-2: Formula: (< 0 v_~ctr1~0_12) InVars {~ctr1~0=v_~ctr1~0_12} OutVars{~ctr1~0=v_~ctr1~0_12} AuxVars[] AssignedVars[][55], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 295#(<= ~idx~0 0), 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 127#L773-2true]) [2021-03-25 03:17:34,270 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:34,270 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,270 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,270 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,270 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][112], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 204#true, 270#(= ~readerprogress1~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 293#true, 165#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 220#true, Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:34,271 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,271 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,271 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:34,271 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,274 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([845] L773-2-->L773-2: Formula: (< 0 v_~ctr1~0_12) InVars {~ctr1~0=v_~ctr1~0_12} OutVars{~ctr1~0=v_~ctr1~0_12} AuxVars[] AssignedVars[][55], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~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: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 295#(<= ~idx~0 0), 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~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)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 127#L773-2true]) [2021-03-25 03:17:34,274 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-25 03:17:34,274 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,274 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,274 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2021-03-25 03:17:34,274 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][112], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), 100#qrcu_reader1EXITtrue, Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 165#true, 293#true, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), 110#qrcu_reader2EXITtrue, Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 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)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:34,275 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,275 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,275 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:34,275 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:34,325 INFO L129 PetriNetUnfolder]: 1747/4989 cut-off events. [2021-03-25 03:17:34,325 INFO L130 PetriNetUnfolder]: For 21228/21633 co-relation queries the response was YES. [2021-03-25 03:17:34,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17505 conditions, 4989 events. 1747/4989 cut-off events. For 21228/21633 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 51958 event pairs, 54 based on Foata normal form. 160/5051 useless extension candidates. Maximal degree in co-relation 16053. Up to 766 conditions per place. [2021-03-25 03:17:34,405 INFO L142 LiptonReduction]: Number of co-enabled transitions 6740 [2021-03-25 03:17:39,058 INFO L154 LiptonReduction]: Checked pairs total: 6231 [2021-03-25 03:17:39,058 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:39,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5240 [2021-03-25 03:17:39,058 INFO L480 AbstractCegarLoop]: Abstraction has has 132 places, 240 transitions, 2296 flow [2021-03-25 03:17:39,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:39,059 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:39,059 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-25 03:17:39,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 03:17:39,059 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-25 03:17:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -378080908, now seen corresponding path program 1 times [2021-03-25 03:17:39,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:39,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270858169] [2021-03-25 03:17:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:39,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:39,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:39,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:39,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:39,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:39,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:39,084 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-25 03:17:39,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270858169] [2021-03-25 03:17:39,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:39,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 03:17:39,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058764511] [2021-03-25 03:17:39,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:17:39,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:17:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:17:39,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 301 [2021-03-25 03:17:39,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 240 transitions, 2296 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:39,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:39,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 301 [2021-03-25 03:17:39,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:39,641 INFO L129 PetriNetUnfolder]: 1924/5454 cut-off events. [2021-03-25 03:17:39,641 INFO L130 PetriNetUnfolder]: For 24747/25077 co-relation queries the response was YES. [2021-03-25 03:17:39,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19705 conditions, 5454 events. 1924/5454 cut-off events. For 24747/25077 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 57682 event pairs, 88 based on Foata normal form. 251/5312 useless extension candidates. Maximal degree in co-relation 18498. Up to 696 conditions per place. [2021-03-25 03:17:39,698 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 21 selfloop transitions, 3 changer transitions 20/241 dead transitions. [2021-03-25 03:17:39,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 241 transitions, 2323 flow [2021-03-25 03:17:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:17:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:17:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2021-03-25 03:17:39,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9003322259136213 [2021-03-25 03:17:39,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2021-03-25 03:17:39,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2021-03-25 03:17:39,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:39,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2021-03-25 03:17:39,703 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-25 03:17:39,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:39,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:39,704 INFO L185 Difference]: Start difference. First operand has 132 places, 240 transitions, 2296 flow. Second operand 3 states and 813 transitions. [2021-03-25 03:17:39,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 241 transitions, 2323 flow [2021-03-25 03:17:39,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 241 transitions, 2315 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:17:39,834 INFO L241 Difference]: Finished difference. Result has 131 places, 213 transitions, 1998 flow [2021-03-25 03:17:39,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1998, PETRI_PLACES=131, PETRI_TRANSITIONS=213} [2021-03-25 03:17:39,835 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 53 predicate places. [2021-03-25 03:17:39,835 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:39,835 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 213 transitions, 1998 flow [2021-03-25 03:17:39,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 213 transitions, 1998 flow [2021-03-25 03:17:39,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 213 transitions, 1998 flow [2021-03-25 03:17:40,159 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][59], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 204#true, 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 282#(<= 1 ~ctr2~0), Black: 280#(<= 0 ~ctr2~0), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 299#(= ~idx~0 1), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:40,159 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,159 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:40,159 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,159 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,159 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][101], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 204#true, 270#(= ~readerprogress1~0 2), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), Black: 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 280#(<= 0 ~ctr2~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 299#(= ~idx~0 1), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:40,159 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,160 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,160 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:40,160 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L774-2-->L774-2: Formula: (< 0 v_~ctr2~0_13) InVars {~ctr2~0=v_~ctr2~0_13} OutVars{~ctr2~0=v_~ctr2~0_13} AuxVars[] AssignedVars[][59], [193#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 73#L774-2true, Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), 275#(= ~readerprogress2~0 2), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 282#(<= 1 ~ctr2~0), Black: 214#true, Black: 280#(<= 0 ~ctr2~0), 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 299#(= ~idx~0 1), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), Black: 187#(= ~readerprogress2~0 0)]) [2021-03-25 03:17:40,160 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,160 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([961] L774-2-->L777: Formula: (and (= |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))) (= |v_qrcu_updaterThread1of1ForFork2_#t~mem22_29| (select (select |v_#memory_int_113| |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|) |v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|)) (not (< 0 v_~ctr2~0_162))) InVars {qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_28|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, ~ctr2~0=v_~ctr2~0_162} OutVars{qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base_41|, #pthreadsMutex=|v_#pthreadsMutex_27|, qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset=|v_qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset_33|, ~#mutex~0.base=|v_~#mutex~0.base_36|, #memory_int=|v_#memory_int_113|, ~#mutex~0.offset=|v_~#mutex~0.offset_36|, qrcu_updaterThread1of1ForFork2_#t~mem22=|v_qrcu_updaterThread1of1ForFork2_#t~mem22_29|, ~ctr2~0=v_~ctr2~0_162} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~mem22][101], [Black: 257#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 259#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 246#true, Black: 249#(<= 2 (+ ~ctr1~0 ~ctr2~0)), 200#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 253#(and (<= 2 (+ ~ctr2~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 192#(= ~readerprogress1~0 0), Black: 255#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), 270#(= ~readerprogress1~0 2), 207#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0), Black: 209#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (= ~readerprogress2~0 0)), 275#(= ~readerprogress2~0 2), Black: 206#(= ~readerprogress2~0 0), 21#L786-2true, 280#(<= 0 ~ctr2~0), 216#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 214#true, 225#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 281#(<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|), Black: 282#(<= 1 ~ctr2~0), Black: 284#(and (<= 0 ~ctr2~0) (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|)), Black: 286#(and (<= 0 |qrcu_updaterThread1of1ForFork2_#t~post18|) (<= 1 ~ctr2~0)), 100#qrcu_reader1EXITtrue, 165#true, 299#(= ~idx~0 1), 110#qrcu_reader2EXITtrue, Black: 227#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 229#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 231#(and (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 233#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0) (<= 2 (+ ~ctr1~0 ~ctr2~0))), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 235#(and (<= 2 (+ ~ctr1~0 qrcu_updaterThread1of1ForFork2_~sum~0)) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 220#true, Black: 222#(and (<= 0 ~ctr2~0) (= ~ctr1~0 1)), Black: 223#(<= 2 (+ ~ctr1~0 ~ctr2~0)), Black: 182#(= ~readerprogress1~0 0), 251#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 187#(= ~readerprogress2~0 0), 62#L777true]) [2021-03-25 03:17:40,161 INFO L384 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,161 INFO L387 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2021-03-25 03:17:40,173 INFO L129 PetriNetUnfolder]: 1151/3587 cut-off events. [2021-03-25 03:17:40,173 INFO L130 PetriNetUnfolder]: For 18098/18378 co-relation queries the response was YES. [2021-03-25 03:17:40,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13218 conditions, 3587 events. 1151/3587 cut-off events. For 18098/18378 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 37428 event pairs, 52 based on Foata normal form. 116/3640 useless extension candidates. Maximal degree in co-relation 12156. Up to 563 conditions per place. [2021-03-25 03:17:40,238 INFO L142 LiptonReduction]: Number of co-enabled transitions 5746 [2021-03-25 03:17:43,695 INFO L154 LiptonReduction]: Checked pairs total: 9551 [2021-03-25 03:17:43,695 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 03:17:43,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3861 [2021-03-25 03:17:43,696 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 213 transitions, 1998 flow [2021-03-25 03:17:43,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:43,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:43,696 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-25 03:17:43,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 03:17:43,697 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-25 03:17:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash 105254881, now seen corresponding path program 1 times [2021-03-25 03:17:43,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:43,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771479429] [2021-03-25 03:17:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:43,728 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 03:17:43,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 03:17:43,735 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 03:17:43,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 03:17:43,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:17:43,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:17:43,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:43,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:43,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:43,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:43,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:43,794 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-25 03:17:43,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771479429] [2021-03-25 03:17:43,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:43,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:17:43,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796789019] [2021-03-25 03:17:43,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:17:43,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:17:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:17:43,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 302 [2021-03-25 03:17:43,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 213 transitions, 1998 flow. Second operand has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:43,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:43,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 302 [2021-03-25 03:17:43,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:45,960 INFO L129 PetriNetUnfolder]: 6951/13170 cut-off events. [2021-03-25 03:17:45,960 INFO L130 PetriNetUnfolder]: For 59540/60010 co-relation queries the response was YES. [2021-03-25 03:17:46,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51308 conditions, 13170 events. 6951/13170 cut-off events. For 59540/60010 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 116600 event pairs, 469 based on Foata normal form. 439/10821 useless extension candidates. Maximal degree in co-relation 49102. Up to 3022 conditions per place. [2021-03-25 03:17:46,202 INFO L132 encePairwiseOnDemand]: 274/302 looper letters, 173 selfloop transitions, 110 changer transitions 251/556 dead transitions. [2021-03-25 03:17:46,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 556 transitions, 5877 flow [2021-03-25 03:17:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-25 03:17:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-25 03:17:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3761 transitions. [2021-03-25 03:17:46,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6554548623213663 [2021-03-25 03:17:46,223 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3761 transitions. [2021-03-25 03:17:46,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3761 transitions. [2021-03-25 03:17:46,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:46,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3761 transitions. [2021-03-25 03:17:46,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 197.94736842105263) internal successors, (3761), 19 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:46,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 302.0) internal successors, (6040), 20 states have internal predecessors, (6040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:46,322 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 302.0) internal successors, (6040), 20 states have internal predecessors, (6040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:46,322 INFO L185 Difference]: Start difference. First operand has 131 places, 213 transitions, 1998 flow. Second operand 19 states and 3761 transitions. [2021-03-25 03:17:46,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 556 transitions, 5877 flow [2021-03-25 03:17:46,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 556 transitions, 5872 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 03:17:46,679 INFO L241 Difference]: Finished difference. Result has 156 places, 206 transitions, 2338 flow [2021-03-25 03:17:46,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1995, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2338, PETRI_PLACES=156, PETRI_TRANSITIONS=206} [2021-03-25 03:17:46,679 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 78 predicate places. [2021-03-25 03:17:46,679 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:46,680 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 206 transitions, 2338 flow [2021-03-25 03:17:46,680 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 206 transitions, 2338 flow [2021-03-25 03:17:46,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 206 transitions, 2338 flow [2021-03-25 03:17:46,896 INFO L129 PetriNetUnfolder]: 676/2222 cut-off events. [2021-03-25 03:17:46,896 INFO L130 PetriNetUnfolder]: For 21531/21764 co-relation queries the response was YES. [2021-03-25 03:17:46,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10514 conditions, 2222 events. 676/2222 cut-off events. For 21531/21764 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21113 event pairs, 53 based on Foata normal form. 82/2168 useless extension candidates. Maximal degree in co-relation 10365. Up to 407 conditions per place. [2021-03-25 03:17:46,949 INFO L142 LiptonReduction]: Number of co-enabled transitions 3326 [2021-03-25 03:17:47,959 INFO L154 LiptonReduction]: Checked pairs total: 9590 [2021-03-25 03:17:47,959 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 03:17:47,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1281 [2021-03-25 03:17:47,960 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 205 transitions, 2354 flow [2021-03-25 03:17:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 183.66666666666666) internal successors, (1653), 9 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:47,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:47,961 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-25 03:17:47,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 03:17:47,961 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-25 03:17:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1062836270, now seen corresponding path program 1 times [2021-03-25 03:17:47,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:47,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667321751] [2021-03-25 03:17:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:47,989 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:47,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:47,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:47,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:47,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:48,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:48,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:48,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:48,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:48,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:48,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:48,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:48,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:48,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:48,019 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-25 03:17:48,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667321751] [2021-03-25 03:17:48,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:48,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:48,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003498918] [2021-03-25 03:17:48,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:48,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:48,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 305 [2021-03-25 03:17:48,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 205 transitions, 2354 flow. Second operand has 7 states, 7 states have (on average 207.57142857142858) internal successors, (1453), 7 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:48,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:48,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 305 [2021-03-25 03:17:48,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:48,647 INFO L129 PetriNetUnfolder]: 1097/3070 cut-off events. [2021-03-25 03:17:48,647 INFO L130 PetriNetUnfolder]: For 30492/30755 co-relation queries the response was YES. [2021-03-25 03:17:48,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15957 conditions, 3070 events. 1097/3070 cut-off events. For 30492/30755 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 28638 event pairs, 89 based on Foata normal form. 160/3069 useless extension candidates. Maximal degree in co-relation 15727. Up to 611 conditions per place. [2021-03-25 03:17:48,671 INFO L132 encePairwiseOnDemand]: 285/305 looper letters, 109 selfloop transitions, 91 changer transitions 42/288 dead transitions. [2021-03-25 03:17:48,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 288 transitions, 3820 flow [2021-03-25 03:17:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:17:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:17:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2383 transitions. [2021-03-25 03:17:48,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7102831594634873 [2021-03-25 03:17:48,692 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2383 transitions. [2021-03-25 03:17:48,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2383 transitions. [2021-03-25 03:17:48,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:48,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2383 transitions. [2021-03-25 03:17:48,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 216.63636363636363) internal successors, (2383), 11 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:48,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 305.0) internal successors, (3660), 12 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:48,701 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 305.0) internal successors, (3660), 12 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:48,701 INFO L185 Difference]: Start difference. First operand has 145 places, 205 transitions, 2354 flow. Second operand 11 states and 2383 transitions. [2021-03-25 03:17:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 288 transitions, 3820 flow [2021-03-25 03:17:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 288 transitions, 3381 flow, removed 129 selfloop flow, removed 16 redundant places. [2021-03-25 03:17:48,810 INFO L241 Difference]: Finished difference. Result has 143 places, 214 transitions, 2483 flow [2021-03-25 03:17:48,811 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2483, PETRI_PLACES=143, PETRI_TRANSITIONS=214} [2021-03-25 03:17:48,811 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2021-03-25 03:17:48,811 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:48,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 214 transitions, 2483 flow [2021-03-25 03:17:48,811 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 214 transitions, 2483 flow [2021-03-25 03:17:48,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 214 transitions, 2483 flow [2021-03-25 03:17:48,990 INFO L129 PetriNetUnfolder]: 617/2134 cut-off events. [2021-03-25 03:17:48,991 INFO L130 PetriNetUnfolder]: For 20316/20513 co-relation queries the response was YES. [2021-03-25 03:17:49,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10018 conditions, 2134 events. 617/2134 cut-off events. For 20316/20513 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20853 event pairs, 43 based on Foata normal form. 95/2117 useless extension candidates. Maximal degree in co-relation 9746. Up to 355 conditions per place. [2021-03-25 03:17:49,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 3314 [2021-03-25 03:17:49,322 INFO L154 LiptonReduction]: Checked pairs total: 4385 [2021-03-25 03:17:49,322 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:49,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 512 [2021-03-25 03:17:49,323 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 214 transitions, 2483 flow [2021-03-25 03:17:49,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 207.57142857142858) internal successors, (1453), 7 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:49,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:49,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:17:49,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 03:17:49,324 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-25 03:17:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash -573560150, now seen corresponding path program 1 times [2021-03-25 03:17:49,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:49,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579584705] [2021-03-25 03:17:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:49,353 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:49,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:49,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:49,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:49,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:49,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:49,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:49,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:49,377 INFO L142 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-03-25 03:17:49,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:49,384 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-03-25 03:17:49,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:49,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:49,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:49,392 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-25 03:17:49,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579584705] [2021-03-25 03:17:49,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:49,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:17:49,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748800650] [2021-03-25 03:17:49,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:17:49,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:49,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:17:49,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:17:49,396 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 305 [2021-03-25 03:17:49,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 214 transitions, 2483 flow. Second operand has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:49,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:49,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 305 [2021-03-25 03:17:49,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:50,108 INFO L129 PetriNetUnfolder]: 1009/2967 cut-off events. [2021-03-25 03:17:50,108 INFO L130 PetriNetUnfolder]: For 30559/30734 co-relation queries the response was YES. [2021-03-25 03:17:50,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15307 conditions, 2967 events. 1009/2967 cut-off events. For 30559/30734 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 27834 event pairs, 119 based on Foata normal form. 124/2919 useless extension candidates. Maximal degree in co-relation 14972. Up to 550 conditions per place. [2021-03-25 03:17:50,129 INFO L132 encePairwiseOnDemand]: 283/305 looper letters, 115 selfloop transitions, 105 changer transitions 36/302 dead transitions. [2021-03-25 03:17:50,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 302 transitions, 3952 flow [2021-03-25 03:17:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 03:17:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 03:17:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3215 transitions. [2021-03-25 03:17:50,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7027322404371584 [2021-03-25 03:17:50,135 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3215 transitions. [2021-03-25 03:17:50,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3215 transitions. [2021-03-25 03:17:50,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:50,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3215 transitions. [2021-03-25 03:17:50,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 214.33333333333334) internal successors, (3215), 15 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:50,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 305.0) internal successors, (4880), 16 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:50,147 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 305.0) internal successors, (4880), 16 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:50,148 INFO L185 Difference]: Start difference. First operand has 143 places, 214 transitions, 2483 flow. Second operand 15 states and 3215 transitions. [2021-03-25 03:17:50,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 302 transitions, 3952 flow [2021-03-25 03:17:50,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 302 transitions, 3801 flow, removed 53 selfloop flow, removed 4 redundant places. [2021-03-25 03:17:50,239 INFO L241 Difference]: Finished difference. Result has 158 places, 226 transitions, 2867 flow [2021-03-25 03:17:50,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=2394, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2867, PETRI_PLACES=158, PETRI_TRANSITIONS=226} [2021-03-25 03:17:50,240 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 80 predicate places. [2021-03-25 03:17:50,240 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:50,240 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 226 transitions, 2867 flow [2021-03-25 03:17:50,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 226 transitions, 2867 flow [2021-03-25 03:17:50,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 158 places, 226 transitions, 2867 flow [2021-03-25 03:17:50,405 INFO L129 PetriNetUnfolder]: 561/2020 cut-off events. [2021-03-25 03:17:50,405 INFO L130 PetriNetUnfolder]: For 21092/21288 co-relation queries the response was YES. [2021-03-25 03:17:50,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 2020 events. 561/2020 cut-off events. For 21092/21288 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19772 event pairs, 51 based on Foata normal form. 65/1960 useless extension candidates. Maximal degree in co-relation 9312. Up to 351 conditions per place. [2021-03-25 03:17:50,435 INFO L142 LiptonReduction]: Number of co-enabled transitions 3270 [2021-03-25 03:17:50,947 INFO L154 LiptonReduction]: Checked pairs total: 9991 [2021-03-25 03:17:50,947 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 03:17:50,947 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 707 [2021-03-25 03:17:50,947 INFO L480 AbstractCegarLoop]: Abstraction has has 158 places, 226 transitions, 2867 flow [2021-03-25 03:17:50,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 207.375) internal successors, (1659), 8 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:50,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:50,948 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-25 03:17:50,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 03:17:50,948 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-25 03:17:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash -73786630, now seen corresponding path program 1 times [2021-03-25 03:17:50,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:50,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756698293] [2021-03-25 03:17:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:50,974 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 03:17:50,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 03:17:50,980 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 03:17:50,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 03:17:50,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:50,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:17:50,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:50,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:17:51,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:51,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:51,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:51,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:51,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:51,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:51,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:51,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:51,023 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-25 03:17:51,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756698293] [2021-03-25 03:17:51,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:51,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:17:51,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004762386] [2021-03-25 03:17:51,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:17:51,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:17:51,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:17:51,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 306 [2021-03-25 03:17:51,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 226 transitions, 2867 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-25 03:17:51,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:51,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 306 [2021-03-25 03:17:51,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:51,995 INFO L129 PetriNetUnfolder]: 1617/3721 cut-off events. [2021-03-25 03:17:51,995 INFO L130 PetriNetUnfolder]: For 32089/32192 co-relation queries the response was YES. [2021-03-25 03:17:52,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18718 conditions, 3721 events. 1617/3721 cut-off events. For 32089/32192 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 30631 event pairs, 206 based on Foata normal form. 98/3182 useless extension candidates. Maximal degree in co-relation 18410. Up to 1070 conditions per place. [2021-03-25 03:17:52,020 INFO L132 encePairwiseOnDemand]: 283/306 looper letters, 190 selfloop transitions, 123 changer transitions 39/373 dead transitions. [2021-03-25 03:17:52,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 373 transitions, 4689 flow [2021-03-25 03:17:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-25 03:17:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-25 03:17:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3511 transitions. [2021-03-25 03:17:52,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6374364560639071 [2021-03-25 03:17:52,029 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3511 transitions. [2021-03-25 03:17:52,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3511 transitions. [2021-03-25 03:17:52,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:52,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3511 transitions. [2021-03-25 03:17:52,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 195.05555555555554) internal successors, (3511), 18 states have internal predecessors, (3511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:52,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:52,039 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:52,040 INFO L185 Difference]: Start difference. First operand has 158 places, 226 transitions, 2867 flow. Second operand 18 states and 3511 transitions. [2021-03-25 03:17:52,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 373 transitions, 4689 flow [2021-03-25 03:17:52,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 373 transitions, 4520 flow, removed 57 selfloop flow, removed 4 redundant places. [2021-03-25 03:17:52,203 INFO L241 Difference]: Finished difference. Result has 177 places, 240 transitions, 3101 flow [2021-03-25 03:17:52,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2635, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3101, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2021-03-25 03:17:52,204 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 99 predicate places. [2021-03-25 03:17:52,204 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:52,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 240 transitions, 3101 flow [2021-03-25 03:17:52,204 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 240 transitions, 3101 flow [2021-03-25 03:17:52,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 176 places, 240 transitions, 3101 flow [2021-03-25 03:17:52,361 INFO L129 PetriNetUnfolder]: 515/1790 cut-off events. [2021-03-25 03:17:52,362 INFO L130 PetriNetUnfolder]: For 17629/17826 co-relation queries the response was YES. [2021-03-25 03:17:52,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8589 conditions, 1790 events. 515/1790 cut-off events. For 17629/17826 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16372 event pairs, 51 based on Foata normal form. 59/1687 useless extension candidates. Maximal degree in co-relation 8356. Up to 236 conditions per place. [2021-03-25 03:17:52,390 INFO L142 LiptonReduction]: Number of co-enabled transitions 3066 [2021-03-25 03:17:52,884 INFO L154 LiptonReduction]: Checked pairs total: 7729 [2021-03-25 03:17:52,885 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 03:17:52,885 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 681 [2021-03-25 03:17:52,885 INFO L480 AbstractCegarLoop]: Abstraction has has 174 places, 238 transitions, 3093 flow [2021-03-25 03:17:52,886 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-25 03:17:52,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:52,886 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-25 03:17:52,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 03:17:52,886 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-25 03:17:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -697974167, now seen corresponding path program 1 times [2021-03-25 03:17:52,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:52,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777422116] [2021-03-25 03:17:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:52,915 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:52,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:52,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:52,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:52,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:52,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:52,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:52,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:52,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:17:52,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777422116] [2021-03-25 03:17:52,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:52,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:52,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928779786] [2021-03-25 03:17:52,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:52,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:52,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 308 [2021-03-25 03:17:52,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 238 transitions, 3093 flow. Second operand has 7 states, 7 states have (on average 208.57142857142858) internal successors, (1460), 7 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:52,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:52,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 308 [2021-03-25 03:17:52,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:53,494 INFO L129 PetriNetUnfolder]: 799/2401 cut-off events. [2021-03-25 03:17:53,494 INFO L130 PetriNetUnfolder]: For 26650/26854 co-relation queries the response was YES. [2021-03-25 03:17:53,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12671 conditions, 2401 events. 799/2401 cut-off events. For 26650/26854 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21603 event pairs, 111 based on Foata normal form. 86/2285 useless extension candidates. Maximal degree in co-relation 12409. Up to 439 conditions per place. [2021-03-25 03:17:53,514 INFO L132 encePairwiseOnDemand]: 288/308 looper letters, 110 selfloop transitions, 89 changer transitions 16/272 dead transitions. [2021-03-25 03:17:53,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 272 transitions, 3918 flow [2021-03-25 03:17:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:17:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:17:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2368 transitions. [2021-03-25 03:17:53,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6989374262101535 [2021-03-25 03:17:53,517 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2368 transitions. [2021-03-25 03:17:53,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2368 transitions. [2021-03-25 03:17:53,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:53,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2368 transitions. [2021-03-25 03:17:53,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 215.27272727272728) internal successors, (2368), 11 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:53,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 308.0) internal successors, (3696), 12 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:53,522 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 308.0) internal successors, (3696), 12 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:53,522 INFO L185 Difference]: Start difference. First operand has 174 places, 238 transitions, 3093 flow. Second operand 11 states and 2368 transitions. [2021-03-25 03:17:53,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 272 transitions, 3918 flow [2021-03-25 03:17:53,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 272 transitions, 3697 flow, removed 44 selfloop flow, removed 11 redundant places. [2021-03-25 03:17:53,610 INFO L241 Difference]: Finished difference. Result has 177 places, 237 transitions, 3177 flow [2021-03-25 03:17:53,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3177, PETRI_PLACES=177, PETRI_TRANSITIONS=237} [2021-03-25 03:17:53,611 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 99 predicate places. [2021-03-25 03:17:53,611 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:53,611 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 237 transitions, 3177 flow [2021-03-25 03:17:53,611 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 237 transitions, 3177 flow [2021-03-25 03:17:53,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 176 places, 237 transitions, 3177 flow [2021-03-25 03:17:53,742 INFO L129 PetriNetUnfolder]: 418/1429 cut-off events. [2021-03-25 03:17:53,743 INFO L130 PetriNetUnfolder]: For 14242/14443 co-relation queries the response was YES. [2021-03-25 03:17:53,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7157 conditions, 1429 events. 418/1429 cut-off events. For 14242/14443 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12155 event pairs, 11 based on Foata normal form. 62/1352 useless extension candidates. Maximal degree in co-relation 6966. Up to 201 conditions per place. [2021-03-25 03:17:53,760 INFO L142 LiptonReduction]: Number of co-enabled transitions 2818 [2021-03-25 03:17:53,876 INFO L154 LiptonReduction]: Checked pairs total: 3622 [2021-03-25 03:17:53,877 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:53,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 266 [2021-03-25 03:17:53,877 INFO L480 AbstractCegarLoop]: Abstraction has has 176 places, 237 transitions, 3177 flow [2021-03-25 03:17:53,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 208.57142857142858) internal successors, (1460), 7 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:53,878 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:53,878 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-25 03:17:53,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 03:17:53,878 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-25 03:17:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1541402542, now seen corresponding path program 1 times [2021-03-25 03:17:53,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:53,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479218104] [2021-03-25 03:17:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:53,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:53,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:53,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:53,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:53,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:53,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:53,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:53,944 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-25 03:17:53,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479218104] [2021-03-25 03:17:53,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:53,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:53,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386787324] [2021-03-25 03:17:53,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:53,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:53,947 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 308 [2021-03-25 03:17:53,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 237 transitions, 3177 flow. Second operand has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:53,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:53,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 308 [2021-03-25 03:17:53,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:54,401 INFO L129 PetriNetUnfolder]: 833/2071 cut-off events. [2021-03-25 03:17:54,402 INFO L130 PetriNetUnfolder]: For 19756/20033 co-relation queries the response was YES. [2021-03-25 03:17:54,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 2071 events. 833/2071 cut-off events. For 19756/20033 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15565 event pairs, 87 based on Foata normal form. 94/1782 useless extension candidates. Maximal degree in co-relation 10869. Up to 441 conditions per place. [2021-03-25 03:17:54,418 INFO L132 encePairwiseOnDemand]: 294/308 looper letters, 126 selfloop transitions, 51 changer transitions 93/340 dead transitions. [2021-03-25 03:17:54,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 340 transitions, 4670 flow [2021-03-25 03:17:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:17:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:17:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2346 transitions. [2021-03-25 03:17:54,420 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7616883116883116 [2021-03-25 03:17:54,420 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2346 transitions. [2021-03-25 03:17:54,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2346 transitions. [2021-03-25 03:17:54,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:54,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2346 transitions. [2021-03-25 03:17:54,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 234.6) internal successors, (2346), 10 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:54,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 308.0) internal successors, (3388), 11 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:54,424 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 308.0) internal successors, (3388), 11 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:54,425 INFO L185 Difference]: Start difference. First operand has 176 places, 237 transitions, 3177 flow. Second operand 10 states and 2346 transitions. [2021-03-25 03:17:54,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 340 transitions, 4670 flow [2021-03-25 03:17:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 340 transitions, 4389 flow, removed 36 selfloop flow, removed 14 redundant places. [2021-03-25 03:17:54,490 INFO L241 Difference]: Finished difference. Result has 178 places, 203 transitions, 2582 flow [2021-03-25 03:17:54,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2582, PETRI_PLACES=178, PETRI_TRANSITIONS=203} [2021-03-25 03:17:54,491 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 100 predicate places. [2021-03-25 03:17:54,491 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:54,491 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 203 transitions, 2582 flow [2021-03-25 03:17:54,491 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 203 transitions, 2582 flow [2021-03-25 03:17:54,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 203 transitions, 2582 flow [2021-03-25 03:17:54,574 INFO L129 PetriNetUnfolder]: 258/1070 cut-off events. [2021-03-25 03:17:54,574 INFO L130 PetriNetUnfolder]: For 8629/8726 co-relation queries the response was YES. [2021-03-25 03:17:54,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 1070 events. 258/1070 cut-off events. For 8629/8726 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8836 event pairs, 10 based on Foata normal form. 13/978 useless extension candidates. Maximal degree in co-relation 4962. Up to 137 conditions per place. [2021-03-25 03:17:54,589 INFO L142 LiptonReduction]: Number of co-enabled transitions 2288 [2021-03-25 03:17:54,810 INFO L154 LiptonReduction]: Checked pairs total: 4206 [2021-03-25 03:17:54,810 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 03:17:54,810 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 319 [2021-03-25 03:17:54,810 INFO L480 AbstractCegarLoop]: Abstraction has has 176 places, 202 transitions, 2598 flow [2021-03-25 03:17:54,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:54,811 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:54,811 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-25 03:17:54,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 03:17:54,811 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-25 03:17:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1440317322, now seen corresponding path program 1 times [2021-03-25 03:17:54,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:54,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714884431] [2021-03-25 03:17:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:54,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:54,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:54,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:54,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:54,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:54,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:54,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:54,869 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-25 03:17:54,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714884431] [2021-03-25 03:17:54,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:54,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:54,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962317808] [2021-03-25 03:17:54,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:54,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:54,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 313 [2021-03-25 03:17:54,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 202 transitions, 2598 flow. Second operand has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:54,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:54,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 313 [2021-03-25 03:17:54,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:55,356 INFO L129 PetriNetUnfolder]: 619/1584 cut-off events. [2021-03-25 03:17:55,356 INFO L130 PetriNetUnfolder]: For 14520/14682 co-relation queries the response was YES. [2021-03-25 03:17:55,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8950 conditions, 1584 events. 619/1584 cut-off events. For 14520/14682 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11364 event pairs, 111 based on Foata normal form. 19/1298 useless extension candidates. Maximal degree in co-relation 8785. Up to 358 conditions per place. [2021-03-25 03:17:55,368 INFO L132 encePairwiseOnDemand]: 298/313 looper letters, 111 selfloop transitions, 51 changer transitions 57/287 dead transitions. [2021-03-25 03:17:55,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 287 transitions, 4031 flow [2021-03-25 03:17:55,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:17:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:17:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2334 transitions. [2021-03-25 03:17:55,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7456869009584665 [2021-03-25 03:17:55,370 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2334 transitions. [2021-03-25 03:17:55,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2334 transitions. [2021-03-25 03:17:55,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:55,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2334 transitions. [2021-03-25 03:17:55,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 233.4) internal successors, (2334), 10 states have internal predecessors, (2334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 313.0) internal successors, (3443), 11 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,374 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 313.0) internal successors, (3443), 11 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,374 INFO L185 Difference]: Start difference. First operand has 176 places, 202 transitions, 2598 flow. Second operand 10 states and 2334 transitions. [2021-03-25 03:17:55,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 287 transitions, 4031 flow [2021-03-25 03:17:55,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 287 transitions, 3783 flow, removed 47 selfloop flow, removed 8 redundant places. [2021-03-25 03:17:55,418 INFO L241 Difference]: Finished difference. Result has 180 places, 200 transitions, 2565 flow [2021-03-25 03:17:55,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2565, PETRI_PLACES=180, PETRI_TRANSITIONS=200} [2021-03-25 03:17:55,418 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 102 predicate places. [2021-03-25 03:17:55,418 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:55,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 200 transitions, 2565 flow [2021-03-25 03:17:55,419 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 200 transitions, 2565 flow [2021-03-25 03:17:55,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 200 transitions, 2565 flow [2021-03-25 03:17:55,493 INFO L129 PetriNetUnfolder]: 235/881 cut-off events. [2021-03-25 03:17:55,493 INFO L130 PetriNetUnfolder]: For 8383/8483 co-relation queries the response was YES. [2021-03-25 03:17:55,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 881 events. 235/881 cut-off events. For 8383/8483 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6792 event pairs, 11 based on Foata normal form. 9/790 useless extension candidates. Maximal degree in co-relation 4598. Up to 109 conditions per place. [2021-03-25 03:17:55,511 INFO L142 LiptonReduction]: Number of co-enabled transitions 2088 [2021-03-25 03:17:55,541 INFO L154 LiptonReduction]: Checked pairs total: 2151 [2021-03-25 03:17:55,541 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:55,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-25 03:17:55,542 INFO L480 AbstractCegarLoop]: Abstraction has has 180 places, 200 transitions, 2565 flow [2021-03-25 03:17:55,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:55,542 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-25 03:17:55,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 03:17:55,542 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-25 03:17:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 512872593, now seen corresponding path program 1 times [2021-03-25 03:17:55,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:55,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953142026] [2021-03-25 03:17:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:55,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:55,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:55,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:55,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:55,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:55,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:55,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:55,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:55,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:55,606 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-25 03:17:55,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953142026] [2021-03-25 03:17:55,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:55,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:17:55,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656832897] [2021-03-25 03:17:55,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:17:55,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:55,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:17:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:17:55,610 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 313 [2021-03-25 03:17:55,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 200 transitions, 2565 flow. Second operand has 8 states, 8 states have (on average 223.75) internal successors, (1790), 8 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:55,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 313 [2021-03-25 03:17:55,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:55,895 INFO L129 PetriNetUnfolder]: 522/1317 cut-off events. [2021-03-25 03:17:55,895 INFO L130 PetriNetUnfolder]: For 13667/13802 co-relation queries the response was YES. [2021-03-25 03:17:55,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 1317 events. 522/1317 cut-off events. For 13667/13802 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8928 event pairs, 102 based on Foata normal form. 5/1040 useless extension candidates. Maximal degree in co-relation 7796. Up to 398 conditions per place. [2021-03-25 03:17:55,905 INFO L132 encePairwiseOnDemand]: 299/313 looper letters, 84 selfloop transitions, 36 changer transitions 62/247 dead transitions. [2021-03-25 03:17:55,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 247 transitions, 3488 flow [2021-03-25 03:17:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:17:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:17:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2021-03-25 03:17:55,907 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.741569045083422 [2021-03-25 03:17:55,907 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2089 transitions. [2021-03-25 03:17:55,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2089 transitions. [2021-03-25 03:17:55,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:55,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2089 transitions. [2021-03-25 03:17:55,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 232.11111111111111) internal successors, (2089), 9 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 313.0) internal successors, (3130), 10 states have internal predecessors, (3130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,910 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 313.0) internal successors, (3130), 10 states have internal predecessors, (3130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:55,910 INFO L185 Difference]: Start difference. First operand has 180 places, 200 transitions, 2565 flow. Second operand 9 states and 2089 transitions. [2021-03-25 03:17:55,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 247 transitions, 3488 flow [2021-03-25 03:17:55,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 247 transitions, 3331 flow, removed 48 selfloop flow, removed 6 redundant places. [2021-03-25 03:17:55,954 INFO L241 Difference]: Finished difference. Result has 182 places, 163 transitions, 2076 flow [2021-03-25 03:17:55,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=2432, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2076, PETRI_PLACES=182, PETRI_TRANSITIONS=163} [2021-03-25 03:17:55,955 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 104 predicate places. [2021-03-25 03:17:55,955 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:55,955 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 163 transitions, 2076 flow [2021-03-25 03:17:55,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 163 transitions, 2076 flow [2021-03-25 03:17:55,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 2076 flow [2021-03-25 03:17:56,004 INFO L129 PetriNetUnfolder]: 164/667 cut-off events. [2021-03-25 03:17:56,005 INFO L130 PetriNetUnfolder]: For 7135/7188 co-relation queries the response was YES. [2021-03-25 03:17:56,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 667 events. 164/667 cut-off events. For 7135/7188 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4854 event pairs, 6 based on Foata normal form. 8/616 useless extension candidates. Maximal degree in co-relation 3434. Up to 80 conditions per place. [2021-03-25 03:17:56,017 INFO L142 LiptonReduction]: Number of co-enabled transitions 1548 [2021-03-25 03:17:56,030 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-25 03:17:56,030 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:56,030 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 03:17:56,030 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 2076 flow [2021-03-25 03:17:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 223.75) internal successors, (1790), 8 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:56,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:56,031 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-25 03:17:56,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 03:17:56,031 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-25 03:17:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash 548166292, now seen corresponding path program 1 times [2021-03-25 03:17:56,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:56,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186824606] [2021-03-25 03:17:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:56,054 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 03:17:56,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:56,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:56,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:56,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:56,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:56,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:17:56,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:56,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:56,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:56,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:56,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:56,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-25 03:17:56,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186824606] [2021-03-25 03:17:56,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:56,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:17:56,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682385426] [2021-03-25 03:17:56,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:17:56,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:17:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:17:56,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 313 [2021-03-25 03:17:56,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 2076 flow. Second operand has 11 states, 11 states have (on average 183.63636363636363) internal successors, (2020), 11 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:56,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:56,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 313 [2021-03-25 03:17:56,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:57,014 INFO L129 PetriNetUnfolder]: 532/1426 cut-off events. [2021-03-25 03:17:57,014 INFO L130 PetriNetUnfolder]: For 15573/15596 co-relation queries the response was YES. [2021-03-25 03:17:57,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8215 conditions, 1426 events. 532/1426 cut-off events. For 15573/15596 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9976 event pairs, 39 based on Foata normal form. 16/1233 useless extension candidates. Maximal degree in co-relation 8122. Up to 213 conditions per place. [2021-03-25 03:17:57,029 INFO L132 encePairwiseOnDemand]: 287/313 looper letters, 102 selfloop transitions, 125 changer transitions 104/348 dead transitions. [2021-03-25 03:17:57,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 348 transitions, 4605 flow [2021-03-25 03:17:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-03-25 03:17:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-03-25 03:17:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5686 transitions. [2021-03-25 03:17:57,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6055378061767838 [2021-03-25 03:17:57,034 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5686 transitions. [2021-03-25 03:17:57,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5686 transitions. [2021-03-25 03:17:57,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:57,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5686 transitions. [2021-03-25 03:17:57,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 189.53333333333333) internal successors, (5686), 30 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:57,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 313.0) internal successors, (9703), 31 states have internal predecessors, (9703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:57,049 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 313.0) internal successors, (9703), 31 states have internal predecessors, (9703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:57,049 INFO L185 Difference]: Start difference. First operand has 171 places, 163 transitions, 2076 flow. Second operand 30 states and 5686 transitions. [2021-03-25 03:17:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 348 transitions, 4605 flow [2021-03-25 03:17:57,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 348 transitions, 4230 flow, removed 28 selfloop flow, removed 18 redundant places. [2021-03-25 03:17:57,108 INFO L241 Difference]: Finished difference. Result has 187 places, 180 transitions, 2161 flow [2021-03-25 03:17:57,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2161, PETRI_PLACES=187, PETRI_TRANSITIONS=180} [2021-03-25 03:17:57,108 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 109 predicate places. [2021-03-25 03:17:57,108 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:57,108 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 180 transitions, 2161 flow [2021-03-25 03:17:57,108 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 180 transitions, 2161 flow [2021-03-25 03:17:57,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 180 transitions, 2161 flow [2021-03-25 03:17:57,148 INFO L129 PetriNetUnfolder]: 163/503 cut-off events. [2021-03-25 03:17:57,148 INFO L130 PetriNetUnfolder]: For 4480/4527 co-relation queries the response was YES. [2021-03-25 03:17:57,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 503 events. 163/503 cut-off events. For 4480/4527 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2888 event pairs, 2 based on Foata normal form. 2/436 useless extension candidates. Maximal degree in co-relation 2769. Up to 76 conditions per place. [2021-03-25 03:17:57,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 1370 [2021-03-25 03:17:57,655 INFO L154 LiptonReduction]: Checked pairs total: 2239 [2021-03-25 03:17:57,655 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 03:17:57,655 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 547 [2021-03-25 03:17:57,656 INFO L480 AbstractCegarLoop]: Abstraction has has 180 places, 180 transitions, 2244 flow [2021-03-25 03:17:57,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 183.63636363636363) internal successors, (2020), 11 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:57,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:57,656 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-25 03:17:57,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 03:17:57,656 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-25 03:17:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash 604977669, now seen corresponding path program 1 times [2021-03-25 03:17:57,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:57,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767782071] [2021-03-25 03:17:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:57,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:57,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:57,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:57,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:57,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:57,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:57,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:57,716 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-25 03:17:57,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767782071] [2021-03-25 03:17:57,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:57,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:57,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996276366] [2021-03-25 03:17:57,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:57,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:57,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 325 [2021-03-25 03:17:57,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 180 transitions, 2244 flow. Second operand has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:57,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:57,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 325 [2021-03-25 03:17:57,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:57,991 INFO L129 PetriNetUnfolder]: 335/752 cut-off events. [2021-03-25 03:17:57,991 INFO L130 PetriNetUnfolder]: For 8287/8351 co-relation queries the response was YES. [2021-03-25 03:17:57,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 752 events. 335/752 cut-off events. For 8287/8351 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3839 event pairs, 18 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 4699. Up to 249 conditions per place. [2021-03-25 03:17:57,996 INFO L132 encePairwiseOnDemand]: 304/325 looper letters, 68 selfloop transitions, 32 changer transitions 94/222 dead transitions. [2021-03-25 03:17:57,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 222 transitions, 3108 flow [2021-03-25 03:17:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:17:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:17:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2117 transitions. [2021-03-25 03:17:57,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7237606837606838 [2021-03-25 03:17:57,998 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2117 transitions. [2021-03-25 03:17:57,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2117 transitions. [2021-03-25 03:17:57,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:57,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2117 transitions. [2021-03-25 03:17:58,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 235.22222222222223) internal successors, (2117), 9 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:58,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:58,002 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:58,002 INFO L185 Difference]: Start difference. First operand has 180 places, 180 transitions, 2244 flow. Second operand 9 states and 2117 transitions. [2021-03-25 03:17:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 222 transitions, 3108 flow [2021-03-25 03:17:58,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 222 transitions, 2192 flow, removed 117 selfloop flow, removed 50 redundant places. [2021-03-25 03:17:58,030 INFO L241 Difference]: Finished difference. Result has 138 places, 107 transitions, 955 flow [2021-03-25 03:17:58,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=955, PETRI_PLACES=138, PETRI_TRANSITIONS=107} [2021-03-25 03:17:58,030 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2021-03-25 03:17:58,030 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:58,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 107 transitions, 955 flow [2021-03-25 03:17:58,030 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 107 transitions, 955 flow [2021-03-25 03:17:58,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 107 transitions, 955 flow [2021-03-25 03:17:58,049 INFO L129 PetriNetUnfolder]: 79/302 cut-off events. [2021-03-25 03:17:58,049 INFO L130 PetriNetUnfolder]: For 1104/1113 co-relation queries the response was YES. [2021-03-25 03:17:58,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 302 events. 79/302 cut-off events. For 1104/1113 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1577 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1360. Up to 59 conditions per place. [2021-03-25 03:17:58,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 864 [2021-03-25 03:17:59,073 INFO L154 LiptonReduction]: Checked pairs total: 725 [2021-03-25 03:17:59,073 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-25 03:17:59,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1043 [2021-03-25 03:17:59,074 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 105 transitions, 974 flow [2021-03-25 03:17:59,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:59,074 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-25 03:17:59,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 03:17:59,075 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-25 03:17:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1861961755, now seen corresponding path program 1 times [2021-03-25 03:17:59,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:59,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247568432] [2021-03-25 03:17:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:59,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:59,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:17:59,129 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-25 03:17:59,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247568432] [2021-03-25 03:17:59,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:59,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:59,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91772211] [2021-03-25 03:17:59,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:17:59,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:17:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:17:59,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 341 [2021-03-25 03:17:59,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 105 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 228.85714285714286) internal successors, (1602), 7 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:59,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 341 [2021-03-25 03:17:59,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:59,367 INFO L129 PetriNetUnfolder]: 224/506 cut-off events. [2021-03-25 03:17:59,368 INFO L130 PetriNetUnfolder]: For 2476/2476 co-relation queries the response was YES. [2021-03-25 03:17:59,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 506 events. 224/506 cut-off events. For 2476/2476 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2357 event pairs, 49 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 2932. Up to 160 conditions per place. [2021-03-25 03:17:59,370 INFO L132 encePairwiseOnDemand]: 319/341 looper letters, 50 selfloop transitions, 34 changer transitions 34/142 dead transitions. [2021-03-25 03:17:59,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 142 transitions, 1750 flow [2021-03-25 03:17:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:17:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:17:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2118 transitions. [2021-03-25 03:17:59,372 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901270772238515 [2021-03-25 03:17:59,372 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2118 transitions. [2021-03-25 03:17:59,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2118 transitions. [2021-03-25 03:17:59,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:59,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2118 transitions. [2021-03-25 03:17:59,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 235.33333333333334) internal successors, (2118), 9 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,377 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,377 INFO L185 Difference]: Start difference. First operand has 124 places, 105 transitions, 974 flow. Second operand 9 states and 2118 transitions. [2021-03-25 03:17:59,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 142 transitions, 1750 flow [2021-03-25 03:17:59,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 142 transitions, 1508 flow, removed 52 selfloop flow, removed 15 redundant places. [2021-03-25 03:17:59,387 INFO L241 Difference]: Finished difference. Result has 119 places, 97 transitions, 879 flow [2021-03-25 03:17:59,388 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=879, PETRI_PLACES=119, PETRI_TRANSITIONS=97} [2021-03-25 03:17:59,388 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 41 predicate places. [2021-03-25 03:17:59,388 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:59,388 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 97 transitions, 879 flow [2021-03-25 03:17:59,388 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 97 transitions, 879 flow [2021-03-25 03:17:59,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 97 transitions, 879 flow [2021-03-25 03:17:59,405 INFO L129 PetriNetUnfolder]: 74/266 cut-off events. [2021-03-25 03:17:59,405 INFO L130 PetriNetUnfolder]: For 1352/1378 co-relation queries the response was YES. [2021-03-25 03:17:59,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 266 events. 74/266 cut-off events. For 1352/1378 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1382 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 1417. Up to 66 conditions per place. [2021-03-25 03:17:59,408 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-25 03:17:59,568 INFO L154 LiptonReduction]: Checked pairs total: 601 [2021-03-25 03:17:59,569 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 03:17:59,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 181 [2021-03-25 03:17:59,569 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 878 flow [2021-03-25 03:17:59,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 228.85714285714286) internal successors, (1602), 7 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:17:59,570 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-25 03:17:59,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 03:17:59,570 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-25 03:17:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:17:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash 602432367, now seen corresponding path program 1 times [2021-03-25 03:17:59,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:17:59,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095286469] [2021-03-25 03:17:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:17:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:17:59,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:59,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:59,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:59,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:17:59,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:17:59,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:17:59,626 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-25 03:17:59,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095286469] [2021-03-25 03:17:59,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:17:59,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:17:59,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093033453] [2021-03-25 03:17:59,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:17:59,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:17:59,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:17:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:17:59,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 347 [2021-03-25 03:17:59,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 228.75) internal successors, (1830), 8 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:17:59,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 347 [2021-03-25 03:17:59,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:17:59,771 INFO L129 PetriNetUnfolder]: 189/412 cut-off events. [2021-03-25 03:17:59,771 INFO L130 PetriNetUnfolder]: For 2107/2107 co-relation queries the response was YES. [2021-03-25 03:17:59,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 412 events. 189/412 cut-off events. For 2107/2107 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1823 event pairs, 43 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 2587. Up to 153 conditions per place. [2021-03-25 03:17:59,773 INFO L132 encePairwiseOnDemand]: 327/347 looper letters, 0 selfloop transitions, 0 changer transitions 116/116 dead transitions. [2021-03-25 03:17:59,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 1386 flow [2021-03-25 03:17:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:17:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:17:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1868 transitions. [2021-03-25 03:17:59,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6729106628242075 [2021-03-25 03:17:59,775 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1868 transitions. [2021-03-25 03:17:59,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1868 transitions. [2021-03-25 03:17:59,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:17:59,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1868 transitions. [2021-03-25 03:17:59,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,778 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,778 INFO L185 Difference]: Start difference. First operand has 112 places, 96 transitions, 878 flow. Second operand 8 states and 1868 transitions. [2021-03-25 03:17:59,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 1386 flow [2021-03-25 03:17:59,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 116 transitions, 1211 flow, removed 49 selfloop flow, removed 11 redundant places. [2021-03-25 03:17:59,790 INFO L241 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2021-03-25 03:17:59,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=107, PETRI_TRANSITIONS=0} [2021-03-25 03:17:59,790 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2021-03-25 03:17:59,790 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:17:59,790 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 0 transitions, 0 flow [2021-03-25 03:17:59,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 0 transitions, 0 flow [2021-03-25 03:17:59,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 03:17:59,791 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 03:17:59,791 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 03:17:59,791 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-25 03:17:59,791 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 03:17:59,791 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:17:59,791 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:17:59,791 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 03:17:59,792 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 03:17:59,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 228.75) internal successors, (1830), 8 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:17:59,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 03:17:59,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:17:59 BasicIcfg [2021-03-25 03:17:59,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 03:17:59,796 INFO L168 Benchmark]: Toolchain (without parser) took 52606.14 ms. Allocated memory was 255.9 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 233.6 MB in the beginning and 714.4 MB in the end (delta: -480.8 MB). Peak memory consumption was 550.5 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,796 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.5 MB in the beginning and 237.3 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 03:17:59,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.70 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 233.6 MB in the beginning and 310.9 MB in the end (delta: -77.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 350.2 MB. Free memory was 310.9 MB in the beginning and 308.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,797 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 ms. Allocated memory is still 350.2 MB. Free memory was 308.2 MB in the beginning and 306.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,797 INFO L168 Benchmark]: RCFGBuilder took 947.44 ms. Allocated memory is still 350.2 MB. Free memory was 306.1 MB in the beginning and 268.7 MB in the end (delta: 37.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,797 INFO L168 Benchmark]: TraceAbstraction took 51095.10 ms. Allocated memory was 350.2 MB in the beginning and 1.3 GB in the end (delta: 937.4 MB). Free memory was 268.7 MB in the beginning and 714.4 MB in the end (delta: -445.7 MB). Peak memory consumption was 490.7 MB. Max. memory is 16.0 GB. [2021-03-25 03:17:59,797 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.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.5 MB in the beginning and 237.3 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 496.70 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 233.6 MB in the beginning and 310.9 MB in the end (delta: -77.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 350.2 MB. Free memory was 310.9 MB in the beginning and 308.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.02 ms. Allocated memory is still 350.2 MB. Free memory was 308.2 MB in the beginning and 306.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 947.44 ms. Allocated memory is still 350.2 MB. Free memory was 306.1 MB in the beginning and 268.7 MB in the end (delta: 37.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 51095.10 ms. Allocated memory was 350.2 MB in the beginning and 1.3 GB in the end (delta: 937.4 MB). Free memory was 268.7 MB in the beginning and 714.4 MB in the end (delta: -445.7 MB). Peak memory consumption was 490.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3726.3ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 5610, positive: 5448, positive conditional: 0, positive unconditional: 5448, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3855, positive: 3796, positive conditional: 0, positive unconditional: 3796, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3855, positive: 3796, positive conditional: 0, positive unconditional: 3796, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5610, positive: 1652, positive conditional: 0, positive unconditional: 1652, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 3855, unknown conditional: 0, unknown unconditional: 3855] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 430, Positive conditional cache size: 0, Positive unconditional cache size: 430, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1418.0ms, 82 PlacesBefore, 73 PlacesAfterwards, 104 TransitionsBefore, 95 TransitionsAfterwards, 4322 CoEnabledTransitionPairs, 5 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, 8688 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2079, positive: 1906, positive conditional: 0, positive unconditional: 1906, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 602, positive: 578, positive conditional: 0, positive unconditional: 578, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 602, positive: 578, positive conditional: 0, positive unconditional: 578, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2079, positive: 1328, positive conditional: 0, positive unconditional: 1328, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 602, unknown conditional: 0, unknown unconditional: 602] , Statistics on independence cache: Total cache size (in pairs): 707, Positive cache size: 679, Positive conditional cache size: 0, Positive unconditional cache size: 679, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1847.3ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 1564, positive: 1472, positive conditional: 0, positive unconditional: 1472, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, positive: 233, positive conditional: 0, positive unconditional: 233, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 246, positive: 233, positive conditional: 0, positive unconditional: 233, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1564, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 246, unknown conditional: 0, unknown unconditional: 246] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 625, Positive conditional cache size: 0, Positive unconditional cache size: 625, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.8ms, 71 PlacesBefore, 71 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 3086 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 3736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 756, positive: 674, positive conditional: 0, positive unconditional: 674, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 756, positive: 642, positive conditional: 0, positive unconditional: 642, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 481, Positive conditional cache size: 0, Positive unconditional cache size: 481, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.0ms, 77 PlacesBefore, 77 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1750 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 326, positive: 292, positive conditional: 0, positive unconditional: 292, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 326, positive: 272, positive conditional: 0, positive unconditional: 272, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 501, Positive conditional cache size: 0, Positive unconditional cache size: 501, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 103.5ms, 84 PlacesBefore, 84 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 3678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1656 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 237, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 508, Positive conditional cache size: 0, Positive unconditional cache size: 508, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.9ms, 88 PlacesBefore, 88 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 3732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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] , Cache Queries: [ total: 232, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 508, Positive conditional cache size: 0, Positive unconditional cache size: 508, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 684.0ms, 105 PlacesBefore, 105 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 5094 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 174, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 174, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 520, Positive conditional cache size: 0, Positive unconditional cache size: 520, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1309.4ms, 120 PlacesBefore, 120 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 6012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3653 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 426, positive: 383, positive conditional: 0, positive unconditional: 383, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 426, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 532, Positive conditional cache size: 0, Positive unconditional cache size: 532, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1198.2ms, 122 PlacesBefore, 122 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 5988 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3524 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 393, positive: 349, positive conditional: 0, positive unconditional: 349, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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] , Cache Queries: [ total: 393, positive: 349, positive conditional: 0, positive unconditional: 349, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 532, Positive conditional cache size: 0, Positive unconditional cache size: 532, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1217.4ms, 124 PlacesBefore, 124 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 5930 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3512 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 478, positive: 434, positive conditional: 0, positive unconditional: 434, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 478, positive: 425, positive conditional: 0, positive unconditional: 425, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 589, Positive cache size: 541, Positive conditional cache size: 0, Positive unconditional cache size: 541, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6472.9ms, 134 PlacesBefore, 134 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 7566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 6979 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1588, positive: 1533, positive conditional: 0, positive unconditional: 1533, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1588, positive: 1497, positive conditional: 0, positive unconditional: 1497, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 627, Positive cache size: 577, Positive conditional cache size: 0, Positive unconditional cache size: 577, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5239.2ms, 132 PlacesBefore, 132 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 6740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 6231 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2508, positive: 2459, positive conditional: 0, positive unconditional: 2459, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 96, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2508, positive: 2363, positive conditional: 0, positive unconditional: 2363, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 96, unknown conditional: 0, unknown unconditional: 96] , Statistics on independence cache: Total cache size (in pairs): 723, Positive cache size: 673, Positive conditional cache size: 0, Positive unconditional cache size: 673, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3860.4ms, 131 PlacesBefore, 131 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9551 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2748, positive: 2666, positive conditional: 0, positive unconditional: 2666, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2748, positive: 2639, positive conditional: 0, positive unconditional: 2639, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 695, Positive conditional cache size: 0, Positive unconditional cache size: 695, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1279.7ms, 156 PlacesBefore, 145 PlacesAfterwards, 206 TransitionsBefore, 205 TransitionsAfterwards, 3326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 9590 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3477, positive: 3379, positive conditional: 0, positive unconditional: 3379, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3477, positive: 3337, positive conditional: 0, positive unconditional: 3337, negative: 97, negative conditional: 0, negative unconditional: 97, unknown: 43, unknown conditional: 0, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 636, Positive conditional cache size: 0, Positive unconditional cache size: 636, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 511.3ms, 143 PlacesBefore, 143 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 3314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 4385 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 661, positive: 617, positive conditional: 0, positive unconditional: 617, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 661, positive: 614, positive conditional: 0, positive unconditional: 614, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 639, Positive conditional cache size: 0, Positive unconditional cache size: 639, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 706.8ms, 158 PlacesBefore, 158 PlacesAfterwards, 226 TransitionsBefore, 226 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1801, positive: 1703, positive conditional: 0, positive unconditional: 1703, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 1801, positive: 1701, positive conditional: 0, positive unconditional: 1701, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 641, Positive conditional cache size: 0, Positive unconditional cache size: 641, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 680.4ms, 177 PlacesBefore, 174 PlacesAfterwards, 240 TransitionsBefore, 238 TransitionsAfterwards, 3066 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 7729 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1496, positive: 1432, positive conditional: 0, positive unconditional: 1432, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1496, positive: 1388, positive conditional: 0, positive unconditional: 1388, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 580, Positive conditional cache size: 0, Positive unconditional cache size: 580, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 265.7ms, 177 PlacesBefore, 176 PlacesAfterwards, 237 TransitionsBefore, 237 TransitionsAfterwards, 2818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 3622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 640, positive: 610, positive conditional: 0, positive unconditional: 610, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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] , Cache Queries: [ total: 640, positive: 610, positive conditional: 0, positive unconditional: 610, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 580, Positive conditional cache size: 0, Positive unconditional cache size: 580, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 318.7ms, 178 PlacesBefore, 176 PlacesAfterwards, 203 TransitionsBefore, 202 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 4206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 547, positive: 497, positive conditional: 0, positive unconditional: 497, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 547, positive: 481, positive conditional: 0, positive unconditional: 481, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 582, Positive conditional cache size: 0, Positive unconditional cache size: 582, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.6ms, 180 PlacesBefore, 180 PlacesAfterwards, 200 TransitionsBefore, 200 TransitionsAfterwards, 2088 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 345, positive: 315, positive conditional: 0, positive unconditional: 315, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 345, positive: 310, positive conditional: 0, positive unconditional: 310, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 587, Positive conditional cache size: 0, Positive unconditional cache size: 587, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.9ms, 182 PlacesBefore, 171 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1548 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 235, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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] , Cache Queries: [ total: 235, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 587, Positive conditional cache size: 0, Positive unconditional cache size: 587, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 546.6ms, 187 PlacesBefore, 180 PlacesAfterwards, 180 TransitionsBefore, 180 TransitionsAfterwards, 1370 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2239 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 769, positive: 718, positive conditional: 0, positive unconditional: 718, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 769, positive: 687, positive conditional: 0, positive unconditional: 687, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 577, Positive cache size: 540, Positive conditional cache size: 0, Positive unconditional cache size: 540, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1042.8ms, 138 PlacesBefore, 124 PlacesAfterwards, 107 TransitionsBefore, 105 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 725 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 337, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 337, positive: 292, positive conditional: 0, positive unconditional: 292, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 504, Positive conditional cache size: 0, Positive unconditional cache size: 504, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 180.5ms, 119 PlacesBefore, 112 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 601 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 275, positive: 248, positive conditional: 0, positive unconditional: 248, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 275, positive: 246, positive conditional: 0, positive unconditional: 246, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 489, Positive conditional cache size: 0, Positive unconditional cache size: 489, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7ms, 107 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: 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: 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: 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] , 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): 504, Positive cache size: 489, Positive conditional cache size: 0, Positive unconditional cache size: 489, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - 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.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 50944.4ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 15909.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3820.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 577 SDtfs, 1210 SDslu, 911 SDs, 0 SdLazy, 5032 SolverSat, 663 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2828.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1355.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3177occurred in iteration=18, InterpolantAutomatonStates: 224, 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: 59.0ms SsaConstructionTime, 297.3ms SatisfiabilityAnalysisTime, 1203.9ms InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 2434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...