/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-RepeatedSemanticLbeWithPredicates.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 22:50:36,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 22:50:36,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 22:50:36,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 22:50:36,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 22:50:36,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 22:50:36,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 22:50:36,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 22:50:36,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 22:50:36,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 22:50:36,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 22:50:36,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 22:50:36,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 22:50:36,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 22:50:36,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 22:50:36,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 22:50:36,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 22:50:36,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 22:50:36,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 22:50:37,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 22:50:37,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 22:50:37,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 22:50:37,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 22:50:37,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 22:50:37,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 22:50:37,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 22:50:37,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 22:50:37,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 22:50:37,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 22:50:37,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 22:50:37,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 22:50:37,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 22:50:37,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 22:50:37,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 22:50:37,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 22:50:37,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 22:50:37,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 22:50:37,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 22:50:37,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 22:50:37,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 22:50:37,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 22:50:37,021 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-25 22:50:37,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 22:50:37,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 22:50:37,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 22:50:37,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 22:50:37,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 22:50:37,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 22:50:37,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 22:50:37,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 22:50:37,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 22:50:37,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 22:50:37,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 22:50:37,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 22:50:37,060 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-25 22:50:37,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 22:50:37,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 22:50:37,060 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 22:50:37,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 22:50:37,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 22:50:37,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 22:50:37,340 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 22:50:37,340 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 22:50:37,341 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 22:50:37,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce391f2e3/65a330a28a6b4f51846576ecf4d3d183/FLAG2b063bc4c [2021-03-25 22:50:37,908 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 22:50:37,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2021-03-25 22:50:37,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce391f2e3/65a330a28a6b4f51846576ecf4d3d183/FLAG2b063bc4c [2021-03-25 22:50:38,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce391f2e3/65a330a28a6b4f51846576ecf4d3d183 [2021-03-25 22:50:38,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 22:50:38,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 22:50:38,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 22:50:38,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 22:50:38,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 22:50:38,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f0fbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38, skipping insertion in model container [2021-03-25 22:50:38,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 22:50:38,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 22:50:38,726 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 22:50:38,731 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 22:50:38,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 22:50:38,759 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 22:50:38,796 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 22:50:38,797 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 22:50:38,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 22:50:38,867 INFO L208 MainTranslator]: Completed translation [2021-03-25 22:50:38,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38 WrapperNode [2021-03-25 22:50:38,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 22:50:38,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 22:50:38,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 22:50:38,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 22:50:38,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 22:50:38,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 22:50:38,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 22:50:38,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 22:50:38,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (1/1) ... [2021-03-25 22:50:38,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 22:50:38,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 22:50:38,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 22:50:38,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 22:50:38,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (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 22:50:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-03-25 22:50:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-03-25 22:50:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-03-25 22:50:39,010 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-03-25 22:50:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 22:50:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 22:50:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-03-25 22:50:39,012 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-03-25 22:50:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-03-25 22:50:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 22:50:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 22:50:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 22:50:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 22:50:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 22:50:39,015 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 22:50:39,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 22:50:39,869 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 22:50:39,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 10:50:39 BoogieIcfgContainer [2021-03-25 22:50:39,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 22:50:39,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 22:50:39,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 22:50:39,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 22:50:39,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 10:50:38" (1/3) ... [2021-03-25 22:50:39,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beaf29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 10:50:39, skipping insertion in model container [2021-03-25 22:50:39,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 10:50:38" (2/3) ... [2021-03-25 22:50:39,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beaf29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 10:50:39, skipping insertion in model container [2021-03-25 22:50:39,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 10:50:39" (3/3) ... [2021-03-25 22:50:39,877 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-03-25 22:50:39,882 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 22:50:39,885 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 22:50:39,886 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 22:50:39,934 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,935 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,936 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 22:50:39,936 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 22:50:39,937 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 22:50:39,937 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 22:50:39,937 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,937 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 22:50:39,938 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 22:50:39,938 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 22:50:39,938 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 22:50:39,938 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,939 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,940 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,940 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,940 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,940 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,940 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,941 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,941 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 22:50:39,941 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,941 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 22:50:39,941 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 22:50:39,941 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 22:50:39,941 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,941 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 22:50:39,941 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,942 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 22:50:39,942 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 22:50:39,942 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 22:50:39,943 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,943 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,943 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,943 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,943 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,944 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 22:50:39,944 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 22:50:39,944 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,945 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 22:50:39,945 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 22:50:39,945 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,945 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 22:50:39,945 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 22:50:39,945 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,945 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 22:50:39,946 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 22:50:39,946 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,946 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,946 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,946 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,946 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,947 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,947 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,947 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,947 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,947 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,948 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 22:50:39,948 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 22:50:39,948 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 22:50:39,949 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 22:50:39,949 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,949 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 22:50:39,949 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 22:50:39,949 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 22:50:39,949 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 22:50:39,950 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,950 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,951 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,953 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,954 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,954 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,954 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,959 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 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 22:50:39,960 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,960 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 22:50:39,961 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 22:50:39,961 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 22:50:39,961 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,961 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 22:50:39,961 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,961 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 22:50:39,961 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 22:50:39,961 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 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,962 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,963 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,963 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,963 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 22:50:39,963 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,963 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 22:50:39,963 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 22:50:39,963 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 22:50:39,964 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,964 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 22:50:39,964 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,964 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 22:50:39,964 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 22:50:39,964 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 22:50:39,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,967 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,967 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,967 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,968 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,969 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,970 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,970 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 22:50:39,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,971 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,971 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 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,972 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,973 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,974 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,975 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,975 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,980 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,980 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,980 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,980 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,981 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,982 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,985 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,986 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,987 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,988 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,988 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 22:50:39,988 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 22:50:39,988 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 22:50:39,989 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 22:50:39,989 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 22:50:39,989 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,989 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 22:50:39,989 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 22:50:39,989 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 22:50:39,989 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 22:50:39,989 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 22:50:39,990 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 22:50:39,990 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,990 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 22:50:39,990 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 22:50:39,990 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 22:50:39,990 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 22:50:39,990 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 22:50:39,990 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 22:50:39,991 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 22:50:39,991 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,991 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 22:50:39,991 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 22:50:39,991 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 22:50:39,991 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 22:50:39,991 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 22:50:39,991 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 22:50:39,991 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,991 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,992 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,993 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,994 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 22:50:39,994 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 22:50:39,994 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 22:50:39,994 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 22:50:39,994 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 22:50:39,995 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,995 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 22:50:39,995 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 22:50:39,995 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 22:50:39,995 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 22:50:39,995 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 22:50:39,995 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 22:50:39,995 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 22:50:39,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,996 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,996 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 22:50:39,996 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 22:50:39,996 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 22:50:39,997 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 22:50:39,997 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 22:50:39,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,997 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,998 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:39,999 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,000 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,001 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,005 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 22:50:40,005 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,005 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 22:50:40,005 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 22:50:40,005 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 22:50:40,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,006 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 22:50:40,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,006 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 22:50:40,006 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,006 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~myidx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,006 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 22:50:40,006 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 22:50:40,006 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 22:50:40,007 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,007 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 22:50:40,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,007 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 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 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~myidx~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 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 22:50:40,009 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 22:50:40,009 WARN L313 ript$VariableManager]: TermVariabe qrcu_reader2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,009 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 22:50:40,010 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 22:50:40,010 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 22:50:40,010 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 22:50:40,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,010 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 22:50:40,010 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 22:50:40,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,010 WARN L313 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork1_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,010 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 22:50:40,011 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,011 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 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,012 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 22:50:40,012 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 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~sum~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,012 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 22:50:40,012 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 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 22:50:40,013 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 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 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 22:50:40,013 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,013 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 22:50:40,014 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 22:50:40,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,014 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 22:50:40,014 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 22:50:40,014 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 22:50:40,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,014 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,014 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 22:50:40,014 WARN L313 ript$VariableManager]: TermVariabe qrcu_updaterThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,014 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 22:50:40,015 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 22:50:40,015 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 22:50:40,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,015 WARN L313 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork2_#t~post20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 22:50:40,021 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-25 22:50:40,035 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 22:50:40,061 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 22:50:40,061 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 22:50:40,061 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 22:50:40,061 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 22:50:40,061 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 22:50:40,061 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 22:50:40,061 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 22:50:40,062 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 22:50:40,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 22:50:40,140 INFO L129 PetriNetUnfolder]: 23/183 cut-off events. [2021-03-25 22:50:40,140 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-25 22:50:40,146 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 22:50:40,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 175 transitions, 392 flow [2021-03-25 22:50:40,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 159 transitions, 345 flow [2021-03-25 22:50:40,153 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:40,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 22:50:40,165 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 159 transitions, 345 flow [2021-03-25 22:50:40,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 159 transitions, 345 flow [2021-03-25 22:50:40,196 INFO L129 PetriNetUnfolder]: 21/170 cut-off events. [2021-03-25 22:50:40,197 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 22:50:40,201 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 22:50:40,206 INFO L142 LiptonReduction]: Number of co-enabled transitions 10120 [2021-03-25 22:50:44,577 INFO L154 LiptonReduction]: Checked pairs total: 12308 [2021-03-25 22:50:44,578 INFO L156 LiptonReduction]: Total number of compositions: 85 [2021-03-25 22:50:44,580 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4428 [2021-03-25 22:50:44,596 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2021-03-25 22:50:44,596 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 22:50:44,597 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:44,597 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:50:44,597 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 22:50:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash 392022303, now seen corresponding path program 1 times [2021-03-25 22:50:44,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:44,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285457875] [2021-03-25 22:50:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:44,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:44,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:44,788 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:50:44,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:44,799 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:50:44,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:44,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:44,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:44,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:44,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:44,813 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 22:50:44,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285457875] [2021-03-25 22:50:44,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:44,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:50:44,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135642308] [2021-03-25 22:50:44,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 22:50:44,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 22:50:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 22:50:44,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 260 [2021-03-25 22:50:44,841 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 22:50:44,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:44,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 260 [2021-03-25 22:50:44,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:45,113 INFO L129 PetriNetUnfolder]: 467/1088 cut-off events. [2021-03-25 22:50:45,113 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2021-03-25 22:50:45,119 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 22:50:45,128 INFO L132 encePairwiseOnDemand]: 242/260 looper letters, 45 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2021-03-25 22:50:45,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 388 flow [2021-03-25 22:50:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:50:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:50:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1164 transitions. [2021-03-25 22:50:45,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7461538461538462 [2021-03-25 22:50:45,147 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1164 transitions. [2021-03-25 22:50:45,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1164 transitions. [2021-03-25 22:50:45,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:45,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1164 transitions. [2021-03-25 22:50:45,158 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 22:50:45,167 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 22:50:45,168 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 22:50:45,170 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 199 flow. Second operand 6 states and 1164 transitions. [2021-03-25 22:50:45,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 388 flow [2021-03-25 22:50:45,176 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 22:50:45,179 INFO L241 Difference]: Finished difference. Result has 82 places, 104 transitions, 339 flow [2021-03-25 22:50:45,181 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 22:50:45,181 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2021-03-25 22:50:45,181 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:45,182 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 22:50:45,182 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 104 transitions, 339 flow [2021-03-25 22:50:45,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 104 transitions, 339 flow [2021-03-25 22:50:45,214 INFO L129 PetriNetUnfolder]: 100/433 cut-off events. [2021-03-25 22:50:45,214 INFO L130 PetriNetUnfolder]: For 105/116 co-relation queries the response was YES. [2021-03-25 22:50:45,216 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 22:50:45,222 INFO L142 LiptonReduction]: Number of co-enabled transitions 4322 [2021-03-25 22:50:46,705 INFO L154 LiptonReduction]: Checked pairs total: 8618 [2021-03-25 22:50:46,705 INFO L156 LiptonReduction]: Total number of compositions: 20 [2021-03-25 22:50:46,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1525 [2021-03-25 22:50:46,709 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 321 flow [2021-03-25 22:50:46,709 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 22:50:46,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:46,709 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 22:50:46,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 22:50:46,710 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 22:50:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -727867361, now seen corresponding path program 1 times [2021-03-25 22:50:46,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:46,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361891652] [2021-03-25 22:50:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:46,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:46,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:46,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:46,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:50:46,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361891652] [2021-03-25 22:50:46,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:46,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:50:46,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667420679] [2021-03-25 22:50:46,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:50:46,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:50:46,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:50:46,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 280 [2021-03-25 22:50:46,812 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 22:50:46,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:46,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 280 [2021-03-25 22:50:46,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:46,869 INFO L129 PetriNetUnfolder]: 113/447 cut-off events. [2021-03-25 22:50:46,869 INFO L130 PetriNetUnfolder]: For 105/112 co-relation queries the response was YES. [2021-03-25 22:50:46,871 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 22:50:46,873 INFO L132 encePairwiseOnDemand]: 277/280 looper letters, 6 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2021-03-25 22:50:46,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 341 flow [2021-03-25 22:50:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:50:46,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:50:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2021-03-25 22:50:46,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.925 [2021-03-25 22:50:46,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2021-03-25 22:50:46,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2021-03-25 22:50:46,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:46,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2021-03-25 22:50:46,877 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 22:50:46,879 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 22:50:46,879 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 22:50:46,879 INFO L185 Difference]: Start difference. First operand has 73 places, 95 transitions, 321 flow. Second operand 3 states and 777 transitions. [2021-03-25 22:50:46,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 341 flow [2021-03-25 22:50:46,884 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 22:50:46,886 INFO L241 Difference]: Finished difference. Result has 76 places, 95 transitions, 329 flow [2021-03-25 22:50:46,886 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 22:50:46,886 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2021-03-25 22:50:46,887 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:46,887 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 22:50:46,887 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 95 transitions, 329 flow [2021-03-25 22:50:46,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 95 transitions, 329 flow [2021-03-25 22:50:46,929 INFO L129 PetriNetUnfolder]: 102/409 cut-off events. [2021-03-25 22:50:46,929 INFO L130 PetriNetUnfolder]: For 110/121 co-relation queries the response was YES. [2021-03-25 22:50:46,931 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 2606 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 22:50:46,935 INFO L142 LiptonReduction]: Number of co-enabled transitions 3716 [2021-03-25 22:50:47,399 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 22:50:47,554 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 22:50:47,899 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2021-03-25 22:50:48,067 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 22:50:48,745 INFO L154 LiptonReduction]: Checked pairs total: 4646 [2021-03-25 22:50:48,745 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-25 22:50:48,746 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1859 [2021-03-25 22:50:48,748 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 317 flow [2021-03-25 22:50:48,748 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 22:50:48,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:48,748 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:50:48,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 22:50:48,749 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 22:50:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1127746976, now seen corresponding path program 1 times [2021-03-25 22:50:48,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:48,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589122294] [2021-03-25 22:50:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:48,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:48,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:48,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:48,836 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 22:50:48,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589122294] [2021-03-25 22:50:48,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:48,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:50:48,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615946880] [2021-03-25 22:50:48,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:50:48,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:50:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:50:48,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 297 [2021-03-25 22:50:48,840 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 22:50:48,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:48,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 297 [2021-03-25 22:50:48,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:48,887 INFO L129 PetriNetUnfolder]: 119/451 cut-off events. [2021-03-25 22:50:48,887 INFO L130 PetriNetUnfolder]: For 98/104 co-relation queries the response was YES. [2021-03-25 22:50:48,889 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 2955 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 22:50:48,890 INFO L132 encePairwiseOnDemand]: 294/297 looper letters, 6 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-03-25 22:50:48,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 337 flow [2021-03-25 22:50:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:50:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:50:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2021-03-25 22:50:48,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2021-03-25 22:50:48,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 813 transitions. [2021-03-25 22:50:48,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 813 transitions. [2021-03-25 22:50:48,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:48,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 813 transitions. [2021-03-25 22:50:48,895 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 22:50:48,897 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 22:50:48,897 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 22:50:48,897 INFO L185 Difference]: Start difference. First operand has 70 places, 89 transitions, 317 flow. Second operand 3 states and 813 transitions. [2021-03-25 22:50:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 337 flow [2021-03-25 22:50:48,900 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 22:50:48,904 INFO L241 Difference]: Finished difference. Result has 71 places, 89 transitions, 321 flow [2021-03-25 22:50:48,904 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 22:50:48,905 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2021-03-25 22:50:48,905 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:48,905 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 22:50:48,905 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 321 flow [2021-03-25 22:50:48,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 321 flow [2021-03-25 22:50:48,935 INFO L129 PetriNetUnfolder]: 97/394 cut-off events. [2021-03-25 22:50:48,935 INFO L130 PetriNetUnfolder]: For 95/100 co-relation queries the response was YES. [2021-03-25 22:50:48,937 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 2560 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 22:50:48,941 INFO L142 LiptonReduction]: Number of co-enabled transitions 3086 [2021-03-25 22:50:49,177 INFO L154 LiptonReduction]: Checked pairs total: 5178 [2021-03-25 22:50:49,178 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 22:50:49,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 273 [2021-03-25 22:50:49,181 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 321 flow [2021-03-25 22:50:49,181 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 22:50:49,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:49,181 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 22:50:49,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 22:50:49,182 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 22:50:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 274289960, now seen corresponding path program 1 times [2021-03-25 22:50:49,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:49,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762968410] [2021-03-25 22:50:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:49,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:49,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:49,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:49,288 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 22:50:49,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762968410] [2021-03-25 22:50:49,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:49,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 22:50:49,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744763614] [2021-03-25 22:50:49,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 22:50:49,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 22:50:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 22:50:49,291 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 302 [2021-03-25 22:50:49,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:49,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 302 [2021-03-25 22:50:49,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:49,660 INFO L129 PetriNetUnfolder]: 1554/3282 cut-off events. [2021-03-25 22:50:49,661 INFO L130 PetriNetUnfolder]: For 843/956 co-relation queries the response was YES. [2021-03-25 22:50:49,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 3282 events. 1554/3282 cut-off events. For 843/956 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 24713 event pairs, 416 based on Foata normal form. 54/3037 useless extension candidates. Maximal degree in co-relation 2760. Up to 1103 conditions per place. [2021-03-25 22:50:49,690 INFO L132 encePairwiseOnDemand]: 291/302 looper letters, 39 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2021-03-25 22:50:49,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 550 flow [2021-03-25 22:50:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:50:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:50:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1577 transitions. [2021-03-25 22:50:49,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7459791863765374 [2021-03-25 22:50:49,694 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1577 transitions. [2021-03-25 22:50:49,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1577 transitions. [2021-03-25 22:50:49,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:49,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1577 transitions. [2021-03-25 22:50:49,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 225.28571428571428) internal successors, (1577), 7 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,702 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,702 INFO L185 Difference]: Start difference. First operand has 71 places, 89 transitions, 321 flow. Second operand 7 states and 1577 transitions. [2021-03-25 22:50:49,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 550 flow [2021-03-25 22:50:49,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 22:50:49,715 INFO L241 Difference]: Finished difference. Result has 79 places, 107 transitions, 468 flow [2021-03-25 22:50:49,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=79, PETRI_TRANSITIONS=107} [2021-03-25 22:50:49,716 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2021-03-25 22:50:49,716 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:49,716 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 107 transitions, 468 flow [2021-03-25 22:50:49,716 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 107 transitions, 468 flow [2021-03-25 22:50:49,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 107 transitions, 468 flow [2021-03-25 22:50:49,763 INFO L129 PetriNetUnfolder]: 195/775 cut-off events. [2021-03-25 22:50:49,764 INFO L130 PetriNetUnfolder]: For 319/341 co-relation queries the response was YES. [2021-03-25 22:50:49,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 775 events. 195/775 cut-off events. For 319/341 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6226 event pairs, 10 based on Foata normal form. 4/744 useless extension candidates. Maximal degree in co-relation 1286. Up to 73 conditions per place. [2021-03-25 22:50:49,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 3808 [2021-03-25 22:50:49,850 INFO L154 LiptonReduction]: Checked pairs total: 1664 [2021-03-25 22:50:49,850 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:49,850 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-25 22:50:49,852 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 107 transitions, 468 flow [2021-03-25 22:50:49,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:49,853 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 22:50:49,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 22:50:49,853 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 22:50:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1440046171, now seen corresponding path program 1 times [2021-03-25 22:50:49,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:49,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895953390] [2021-03-25 22:50:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:49,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:49,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:50:49,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:49,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:50:49,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895953390] [2021-03-25 22:50:49,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:49,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 22:50:49,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154268296] [2021-03-25 22:50:49,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:50:49,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:50:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:50:49,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 302 [2021-03-25 22:50:49,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 107 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:49,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 302 [2021-03-25 22:50:49,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:49,974 INFO L129 PetriNetUnfolder]: 210/787 cut-off events. [2021-03-25 22:50:49,974 INFO L130 PetriNetUnfolder]: For 444/567 co-relation queries the response was YES. [2021-03-25 22:50:49,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 787 events. 210/787 cut-off events. For 444/567 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5960 event pairs, 12 based on Foata normal form. 15/762 useless extension candidates. Maximal degree in co-relation 1486. Up to 107 conditions per place. [2021-03-25 22:50:49,981 INFO L132 encePairwiseOnDemand]: 299/302 looper letters, 30 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2021-03-25 22:50:49,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 538 flow [2021-03-25 22:50:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:50:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:50:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2021-03-25 22:50:49,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8830022075055187 [2021-03-25 22:50:49,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2021-03-25 22:50:49,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2021-03-25 22:50:49,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:49,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2021-03-25 22:50:49,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:49,988 INFO L185 Difference]: Start difference. First operand has 79 places, 107 transitions, 468 flow. Second operand 3 states and 800 transitions. [2021-03-25 22:50:49,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 538 flow [2021-03-25 22:50:49,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 22:50:49,995 INFO L241 Difference]: Finished difference. Result has 83 places, 108 transitions, 490 flow [2021-03-25 22:50:49,995 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2021-03-25 22:50:49,995 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2021-03-25 22:50:49,995 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:49,995 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 108 transitions, 490 flow [2021-03-25 22:50:49,996 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 108 transitions, 490 flow [2021-03-25 22:50:49,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 108 transitions, 490 flow [2021-03-25 22:50:50,046 INFO L129 PetriNetUnfolder]: 198/776 cut-off events. [2021-03-25 22:50:50,046 INFO L130 PetriNetUnfolder]: For 442/462 co-relation queries the response was YES. [2021-03-25 22:50:50,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 776 events. 198/776 cut-off events. For 442/462 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6200 event pairs, 11 based on Foata normal form. 6/746 useless extension candidates. Maximal degree in co-relation 1362. Up to 74 conditions per place. [2021-03-25 22:50:50,059 INFO L142 LiptonReduction]: Number of co-enabled transitions 3866 [2021-03-25 22:50:50,098 INFO L154 LiptonReduction]: Checked pairs total: 1746 [2021-03-25 22:50:50,098 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:50,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-03-25 22:50:50,101 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 490 flow [2021-03-25 22:50:50,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:50,101 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 22:50:50,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 22:50:50,102 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 22:50:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1595253721, now seen corresponding path program 1 times [2021-03-25 22:50:50,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:50,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545234640] [2021-03-25 22:50:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:50,144 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:50:50,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:50,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:50,164 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 22:50:50,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545234640] [2021-03-25 22:50:50,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:50,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:50:50,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911207784] [2021-03-25 22:50:50,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:50:50,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:50:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:50:50,167 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 302 [2021-03-25 22:50:50,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:50,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 302 [2021-03-25 22:50:50,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:50,536 INFO L129 PetriNetUnfolder]: 899/1991 cut-off events. [2021-03-25 22:50:50,536 INFO L130 PetriNetUnfolder]: For 2456/2469 co-relation queries the response was YES. [2021-03-25 22:50:50,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 1991 events. 899/1991 cut-off events. For 2456/2469 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15071 event pairs, 33 based on Foata normal form. 119/2010 useless extension candidates. Maximal degree in co-relation 4716. Up to 625 conditions per place. [2021-03-25 22:50:50,557 INFO L132 encePairwiseOnDemand]: 278/302 looper letters, 93 selfloop transitions, 29 changer transitions 0/167 dead transitions. [2021-03-25 22:50:50,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 167 transitions, 1022 flow [2021-03-25 22:50:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:50:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:50:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1548 transitions. [2021-03-25 22:50:50,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7322611163670766 [2021-03-25 22:50:50,561 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1548 transitions. [2021-03-25 22:50:50,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1548 transitions. [2021-03-25 22:50:50,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:50,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1548 transitions. [2021-03-25 22:50:50,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.14285714285714) internal successors, (1548), 7 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,575 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,575 INFO L185 Difference]: Start difference. First operand has 83 places, 108 transitions, 490 flow. Second operand 7 states and 1548 transitions. [2021-03-25 22:50:50,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 167 transitions, 1022 flow [2021-03-25 22:50:50,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 167 transitions, 1010 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 22:50:50,586 INFO L241 Difference]: Finished difference. Result has 93 places, 132 transitions, 761 flow [2021-03-25 22:50:50,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=93, PETRI_TRANSITIONS=132} [2021-03-25 22:50:50,587 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2021-03-25 22:50:50,587 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:50,587 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 132 transitions, 761 flow [2021-03-25 22:50:50,587 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 132 transitions, 761 flow [2021-03-25 22:50:50,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 132 transitions, 761 flow [2021-03-25 22:50:50,644 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][56], [165#true, 39#L725-3true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, 110#qrcu_reader2EXITtrue, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 21#L786-2true, Black: 438#(= ~readerprogress2~0 0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:50,644 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:50,644 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:50,644 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:50,644 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:50,699 INFO L129 PetriNetUnfolder]: 505/1489 cut-off events. [2021-03-25 22:50:50,699 INFO L130 PetriNetUnfolder]: For 2439/2517 co-relation queries the response was YES. [2021-03-25 22:50:50,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4012 conditions, 1489 events. 505/1489 cut-off events. For 2439/2517 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12595 event pairs, 23 based on Foata normal form. 26/1426 useless extension candidates. Maximal degree in co-relation 3606. Up to 237 conditions per place. [2021-03-25 22:50:50,726 INFO L142 LiptonReduction]: Number of co-enabled transitions 4708 [2021-03-25 22:50:50,866 INFO L154 LiptonReduction]: Checked pairs total: 1421 [2021-03-25 22:50:50,866 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:50,866 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 279 [2021-03-25 22:50:50,871 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 132 transitions, 761 flow [2021-03-25 22:50:50,872 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 22:50:50,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:50,872 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 22:50:50,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 22:50:50,872 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 22:50:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash 958500985, now seen corresponding path program 1 times [2021-03-25 22:50:50,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:50,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723848738] [2021-03-25 22:50:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:50,929 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:50:50,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,934 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:50:50,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:50:50,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:50,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:50,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:50:50,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723848738] [2021-03-25 22:50:50,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:50,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:50:50,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986925699] [2021-03-25 22:50:50,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:50:50,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:50:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:50:50,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 302 [2021-03-25 22:50:50,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 132 transitions, 761 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:50,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:50,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 302 [2021-03-25 22:50:50,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:51,305 INFO L129 PetriNetUnfolder]: 929/2045 cut-off events. [2021-03-25 22:50:51,305 INFO L130 PetriNetUnfolder]: For 5302/5387 co-relation queries the response was YES. [2021-03-25 22:50:51,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6839 conditions, 2045 events. 929/2045 cut-off events. For 5302/5387 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15467 event pairs, 80 based on Foata normal form. 44/1988 useless extension candidates. Maximal degree in co-relation 6299. Up to 662 conditions per place. [2021-03-25 22:50:51,334 INFO L132 encePairwiseOnDemand]: 285/302 looper letters, 95 selfloop transitions, 21 changer transitions 0/161 dead transitions. [2021-03-25 22:50:51,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 161 transitions, 1198 flow [2021-03-25 22:50:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:50:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:50:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1300 transitions. [2021-03-25 22:50:51,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.717439293598234 [2021-03-25 22:50:51,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1300 transitions. [2021-03-25 22:50:51,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1300 transitions. [2021-03-25 22:50:51,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:51,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1300 transitions. [2021-03-25 22:50:51,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:51,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:51,349 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:51,349 INFO L185 Difference]: Start difference. First operand has 93 places, 132 transitions, 761 flow. Second operand 6 states and 1300 transitions. [2021-03-25 22:50:51,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 161 transitions, 1198 flow [2021-03-25 22:50:51,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 161 transitions, 1179 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 22:50:51,363 INFO L241 Difference]: Finished difference. Result has 100 places, 140 transitions, 915 flow [2021-03-25 22:50:51,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=915, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2021-03-25 22:50:51,363 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2021-03-25 22:50:51,364 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:51,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 140 transitions, 915 flow [2021-03-25 22:50:51,364 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 140 transitions, 915 flow [2021-03-25 22:50:51,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 140 transitions, 915 flow [2021-03-25 22:50:51,422 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[][18], [519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:51,422 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,422 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,422 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,422 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,422 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][55], [Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:51,423 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][135], [Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 157#L767-4true, Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:51,423 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:51,423 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:51,442 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][16], [519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:51,442 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 22:50:51,442 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:51,442 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:50:51,442 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:51,486 INFO L129 PetriNetUnfolder]: 560/1618 cut-off events. [2021-03-25 22:50:51,487 INFO L130 PetriNetUnfolder]: For 3945/4041 co-relation queries the response was YES. [2021-03-25 22:50:51,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1618 events. 560/1618 cut-off events. For 3945/4041 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13681 event pairs, 17 based on Foata normal form. 33/1562 useless extension candidates. Maximal degree in co-relation 4188. Up to 254 conditions per place. [2021-03-25 22:50:51,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 4992 [2021-03-25 22:50:51,660 INFO L154 LiptonReduction]: Checked pairs total: 1561 [2021-03-25 22:50:51,660 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:51,660 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 296 [2021-03-25 22:50:51,661 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 915 flow [2021-03-25 22:50:51,662 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 22:50:51,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:51,662 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 22:50:51,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 22:50:51,662 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 22:50:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -680330820, now seen corresponding path program 1 times [2021-03-25 22:50:51,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:51,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204942503] [2021-03-25 22:50:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:51,697 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:50:51,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:50:51,702 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-03-25 22:50:51,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 22:50:51,708 INFO L142 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-03-25 22:50:51,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 22:50:51,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:51,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:50:51,720 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 22:50:51,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204942503] [2021-03-25 22:50:51,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:51,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:50:51,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952774994] [2021-03-25 22:50:51,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:50:51,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:50:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:50:51,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 302 [2021-03-25 22:50:51,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:51,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:51,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 302 [2021-03-25 22:50:51,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:54,813 INFO L129 PetriNetUnfolder]: 22893/33458 cut-off events. [2021-03-25 22:50:54,814 INFO L130 PetriNetUnfolder]: For 54403/55253 co-relation queries the response was YES. [2021-03-25 22:50:54,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97892 conditions, 33458 events. 22893/33458 cut-off events. For 54403/55253 co-relation queries the response was YES. Maximal size of possible extension queue 1617. Compared 240162 event pairs, 3212 based on Foata normal form. 502/25556 useless extension candidates. Maximal degree in co-relation 88819. Up to 14451 conditions per place. [2021-03-25 22:50:55,103 INFO L132 encePairwiseOnDemand]: 287/302 looper letters, 176 selfloop transitions, 27 changer transitions 0/250 dead transitions. [2021-03-25 22:50:55,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 250 transitions, 1843 flow [2021-03-25 22:50:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:50:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:50:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1105 transitions. [2021-03-25 22:50:55,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6098233995584988 [2021-03-25 22:50:55,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1105 transitions. [2021-03-25 22:50:55,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1105 transitions. [2021-03-25 22:50:55,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:55,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1105 transitions. [2021-03-25 22:50:55,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.16666666666666) internal successors, (1105), 6 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:55,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:55,113 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:55,113 INFO L185 Difference]: Start difference. First operand has 100 places, 140 transitions, 915 flow. Second operand 6 states and 1105 transitions. [2021-03-25 22:50:55,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 250 transitions, 1843 flow [2021-03-25 22:50:55,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 250 transitions, 1814 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 22:50:55,576 INFO L241 Difference]: Finished difference. Result has 106 places, 160 transitions, 1151 flow [2021-03-25 22:50:55,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1151, PETRI_PLACES=106, PETRI_TRANSITIONS=160} [2021-03-25 22:50:55,577 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2021-03-25 22:50:55,577 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:55,577 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 160 transitions, 1151 flow [2021-03-25 22:50:55,577 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 160 transitions, 1151 flow [2021-03-25 22:50:55,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 160 transitions, 1151 flow [2021-03-25 22:50:55,752 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 438#(= ~readerprogress2~0 0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:55,752 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 22:50:55,752 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:55,752 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:55,752 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:55,756 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[][20], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:55,756 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,756 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,756 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,756 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,757 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 135#L767-8true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:55,757 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,757 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,757 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,757 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,758 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][155], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 157#L767-4true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:55,758 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,758 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,758 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:55,758 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:55,784 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][17], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:55,784 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 22:50:55,784 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:50:55,784 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:55,784 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:55,836 INFO L129 PetriNetUnfolder]: 986/2694 cut-off events. [2021-03-25 22:50:55,836 INFO L130 PetriNetUnfolder]: For 7082/7240 co-relation queries the response was YES. [2021-03-25 22:50:55,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 2694 events. 986/2694 cut-off events. For 7082/7240 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24560 event pairs, 43 based on Foata normal form. 50/2518 useless extension candidates. Maximal degree in co-relation 7382. Up to 398 conditions per place. [2021-03-25 22:50:55,876 INFO L142 LiptonReduction]: Number of co-enabled transitions 5388 [2021-03-25 22:50:56,448 INFO L154 LiptonReduction]: Checked pairs total: 963 [2021-03-25 22:50:56,449 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:56,449 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 872 [2021-03-25 22:50:56,450 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 160 transitions, 1151 flow [2021-03-25 22:50:56,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:56,450 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:56,450 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 22:50:56,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 22:50:56,451 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 22:50:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1974045586, now seen corresponding path program 1 times [2021-03-25 22:50:56,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:56,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780244603] [2021-03-25 22:50:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:56,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:56,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:56,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:56,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:50:56,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780244603] [2021-03-25 22:50:56,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:56,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:50:56,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047958208] [2021-03-25 22:50:56,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:50:56,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:50:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:50:56,479 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 302 [2021-03-25 22:50:56,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 160 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:56,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:56,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 302 [2021-03-25 22:50:56,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:56,580 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][48], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 157#L767-4true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,580 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][113], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 135#L767-8true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,580 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,580 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,580 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[][114], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,581 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,581 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,581 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,581 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,683 INFO L129 PetriNetUnfolder]: 842/2261 cut-off events. [2021-03-25 22:50:56,684 INFO L130 PetriNetUnfolder]: For 6327/6447 co-relation queries the response was YES. [2021-03-25 22:50:56,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6942 conditions, 2261 events. 842/2261 cut-off events. For 6327/6447 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 19639 event pairs, 59 based on Foata normal form. 38/2098 useless extension candidates. Maximal degree in co-relation 6469. Up to 336 conditions per place. [2021-03-25 22:50:56,704 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 14 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2021-03-25 22:50:56,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 1189 flow [2021-03-25 22:50:56,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:50:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:50:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2021-03-25 22:50:56,707 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9271523178807947 [2021-03-25 22:50:56,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2021-03-25 22:50:56,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2021-03-25 22:50:56,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:56,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2021-03-25 22:50:56,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:56,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:56,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:56,712 INFO L185 Difference]: Start difference. First operand has 106 places, 160 transitions, 1151 flow. Second operand 3 states and 840 transitions. [2021-03-25 22:50:56,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 162 transitions, 1189 flow [2021-03-25 22:50:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 162 transitions, 1189 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 22:50:56,734 INFO L241 Difference]: Finished difference. Result has 109 places, 160 transitions, 1156 flow [2021-03-25 22:50:56,734 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=109, PETRI_TRANSITIONS=160} [2021-03-25 22:50:56,734 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 31 predicate places. [2021-03-25 22:50:56,735 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:56,735 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 160 transitions, 1156 flow [2021-03-25 22:50:56,735 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 160 transitions, 1156 flow [2021-03-25 22:50:56,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 160 transitions, 1156 flow [2021-03-25 22:50:56,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 645#true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 135#L767-8true, Black: 647#(= ~readerprogress1~0 2), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 438#(= ~readerprogress2~0 0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,831 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,831 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,831 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:56,831 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:56,834 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[][20], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,834 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,834 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,834 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,835 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,835 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 135#L767-8true, 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,836 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][155], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 157#L767-4true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,836 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:56,836 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:56,868 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][17], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 647#(= ~readerprogress1~0 2), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:56,868 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 22:50:56,868 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:50:56,868 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:56,868 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:56,988 INFO L129 PetriNetUnfolder]: 991/2715 cut-off events. [2021-03-25 22:50:56,988 INFO L130 PetriNetUnfolder]: For 7123/7278 co-relation queries the response was YES. [2021-03-25 22:50:57,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 2715 events. 991/2715 cut-off events. For 7123/7278 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24762 event pairs, 43 based on Foata normal form. 50/2538 useless extension candidates. Maximal degree in co-relation 7428. Up to 398 conditions per place. [2021-03-25 22:50:57,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 5370 [2021-03-25 22:50:57,530 INFO L154 LiptonReduction]: Checked pairs total: 960 [2021-03-25 22:50:57,530 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:57,531 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 796 [2021-03-25 22:50:57,531 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 160 transitions, 1156 flow [2021-03-25 22:50:57,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:57,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:57,532 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 22:50:57,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 22:50:57,532 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 22:50:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash 691491150, now seen corresponding path program 1 times [2021-03-25 22:50:57,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:57,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594377545] [2021-03-25 22:50:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:57,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:57,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:57,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:57,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:57,559 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 22:50:57,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594377545] [2021-03-25 22:50:57,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:57,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:50:57,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581909499] [2021-03-25 22:50:57,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:50:57,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:50:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:50:57,562 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 302 [2021-03-25 22:50:57,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 160 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:57,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:57,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 302 [2021-03-25 22:50:57,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:57,668 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][46], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 157#L767-4true, 672#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,668 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,668 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,668 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,668 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,668 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][113], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 135#L767-8true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 672#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,669 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,669 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[][114], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, 672#true, Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,669 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,669 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,768 INFO L129 PetriNetUnfolder]: 853/2315 cut-off events. [2021-03-25 22:50:57,768 INFO L130 PetriNetUnfolder]: For 6436/6595 co-relation queries the response was YES. [2021-03-25 22:50:57,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7126 conditions, 2315 events. 853/2315 cut-off events. For 6436/6595 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20172 event pairs, 61 based on Foata normal form. 57/2167 useless extension candidates. Maximal degree in co-relation 6618. Up to 342 conditions per place. [2021-03-25 22:50:57,788 INFO L132 encePairwiseOnDemand]: 300/302 looper letters, 15 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2021-03-25 22:50:57,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 162 transitions, 1196 flow [2021-03-25 22:50:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:50:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:50:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2021-03-25 22:50:57,790 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9139072847682119 [2021-03-25 22:50:57,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2021-03-25 22:50:57,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2021-03-25 22:50:57,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:57,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2021-03-25 22:50:57,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:57,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:57,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:57,794 INFO L185 Difference]: Start difference. First operand has 109 places, 160 transitions, 1156 flow. Second operand 3 states and 828 transitions. [2021-03-25 22:50:57,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 162 transitions, 1196 flow [2021-03-25 22:50:57,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 1195 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 22:50:57,816 INFO L241 Difference]: Finished difference. Result has 111 places, 160 transitions, 1162 flow [2021-03-25 22:50:57,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=111, PETRI_TRANSITIONS=160} [2021-03-25 22:50:57,817 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2021-03-25 22:50:57,817 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:57,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 160 transitions, 1162 flow [2021-03-25 22:50:57,817 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 160 transitions, 1162 flow [2021-03-25 22:50:57,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 160 transitions, 1162 flow [2021-03-25 22:50:57,921 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 135#L767-8true, 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), Black: 647#(= ~readerprogress1~0 2), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 674#(= ~readerprogress2~0 2), 165#true, 39#L725-3true, 110#qrcu_reader2EXITtrue, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 560#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 438#(= ~readerprogress2~0 0), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,921 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,921 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,921 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 22:50:57,921 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 22:50:57,924 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[][20], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 140#L767-10true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, 672#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,924 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,925 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,925 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,925 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([945] L766-8-->L767-8: Formula: (and (= v_qrcu_updaterThread1of1ForFork2_~sum~0_127 v_~ctr2~0_313) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32| 0) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_128 1)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_32|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_128, ~ctr2~0=v_~ctr2~0_313} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_31|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_127, ~ctr2~0=v_~ctr2~0_313} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][64], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 135#L767-8true, 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 672#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,926 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([946] L766-8-->L767-4: Formula: (and (<= 0 (+ |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483648)) (<= v_qrcu_updaterThread1of1ForFork2_~sum~0_132 1) (not (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 0)) (<= |v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36| 2147483647) (= v_qrcu_updaterThread1of1ForFork2_~sum~0_131 v_~ctr1~0_341)) InVars {qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_36|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_132} OutVars{qrcu_updaterThread1of1ForFork2_#t~nondet16=|v_qrcu_updaterThread1of1ForFork2_#t~nondet16_35|, ~ctr1~0=v_~ctr1~0_341, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_131} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork2_#t~nondet16, qrcu_updaterThread1of1ForFork2_~sum~0][155], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 591#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 157#L767-4true, 672#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 45#L744-3true, Black: 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 560#true, Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,926 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-03-25 22:50:57,926 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:57,954 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][17], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 647#(= ~readerprogress1~0 2), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, 672#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:57,954 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-25 22:50:57,954 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-25 22:50:57,954 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:57,954 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 22:50:58,034 INFO L129 PetriNetUnfolder]: 998/2758 cut-off events. [2021-03-25 22:50:58,035 INFO L130 PetriNetUnfolder]: For 7179/7334 co-relation queries the response was YES. [2021-03-25 22:50:58,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 2758 events. 998/2758 cut-off events. For 7179/7334 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25152 event pairs, 43 based on Foata normal form. 50/2581 useless extension candidates. Maximal degree in co-relation 7497. Up to 398 conditions per place. [2021-03-25 22:50:58,079 INFO L142 LiptonReduction]: Number of co-enabled transitions 5334 [2021-03-25 22:50:58,456 INFO L154 LiptonReduction]: Checked pairs total: 865 [2021-03-25 22:50:58,456 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:50:58,456 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 639 [2021-03-25 22:50:58,457 INFO L480 AbstractCegarLoop]: Abstraction has has 111 places, 160 transitions, 1162 flow [2021-03-25 22:50:58,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:58,458 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:50:58,458 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 22:50:58,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 22:50:58,458 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 22:50:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:50:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1932804411, now seen corresponding path program 1 times [2021-03-25 22:50:58,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:50:58,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967400676] [2021-03-25 22:50:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:50:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:50:58,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:58,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:58,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:58,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:58,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:58,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:50:58,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:50:58,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:50:58,492 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 22:50:58,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967400676] [2021-03-25 22:50:58,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:50:58,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:50:58,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071828285] [2021-03-25 22:50:58,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 22:50:58,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:50:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 22:50:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 22:50:58,494 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 302 [2021-03-25 22:50:58,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 160 transitions, 1162 flow. Second operand has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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 22:50:58,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:50:58,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 302 [2021-03-25 22:50:58,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:50:58,907 INFO L129 PetriNetUnfolder]: 1307/3426 cut-off events. [2021-03-25 22:50:58,907 INFO L130 PetriNetUnfolder]: For 10368/10723 co-relation queries the response was YES. [2021-03-25 22:50:58,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11081 conditions, 3426 events. 1307/3426 cut-off events. For 10368/10723 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 32147 event pairs, 90 based on Foata normal form. 140/3348 useless extension candidates. Maximal degree in co-relation 10358. Up to 777 conditions per place. [2021-03-25 22:50:58,937 INFO L132 encePairwiseOnDemand]: 291/302 looper letters, 54 selfloop transitions, 32 changer transitions 0/206 dead transitions. [2021-03-25 22:50:58,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 206 transitions, 1598 flow [2021-03-25 22:50:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:50:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:50:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1824 transitions. [2021-03-25 22:50:58,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8628192999053926 [2021-03-25 22:50:58,942 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1824 transitions. [2021-03-25 22:50:58,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1824 transitions. [2021-03-25 22:50:58,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:50:58,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1824 transitions. [2021-03-25 22:50:58,946 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 22:50:58,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:58,950 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:50:58,950 INFO L185 Difference]: Start difference. First operand has 111 places, 160 transitions, 1162 flow. Second operand 7 states and 1824 transitions. [2021-03-25 22:50:58,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 206 transitions, 1598 flow [2021-03-25 22:50:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 206 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 22:50:58,982 INFO L241 Difference]: Finished difference. Result has 121 places, 184 transitions, 1457 flow [2021-03-25 22:50:58,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1457, PETRI_PLACES=121, PETRI_TRANSITIONS=184} [2021-03-25 22:50:58,983 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 43 predicate places. [2021-03-25 22:50:58,983 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:50:58,983 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 184 transitions, 1457 flow [2021-03-25 22:50:58,983 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 184 transitions, 1457 flow [2021-03-25 22:50:58,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 184 transitions, 1457 flow [2021-03-25 22:50:59,138 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][171], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 714#(<= 1 ~ctr2~0), 140#L767-10true, Black: 710#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 712#(= ~ctr2~0 0), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 713#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 718#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:59,138 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 22:50:59,138 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:59,138 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:59,138 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 22:50:59,164 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([957] L750-->L744-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25| v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93) (= v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25 |v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|) (not (= v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47 0)) (not (= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 0)) (= (+ v_~ctr2~0_399 1) v_~ctr2~0_398) (<= 0 (+ |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483648)) (<= |v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58| 2147483647) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47) (= |v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47| (ite (and (< 0 v_~ctr2~0_399) (<= 1 v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25)) 1 0))) InVars {qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_58|, ~ctr2~0=v_~ctr2~0_399} OutVars{qrcu_reader2Thread1of1ForFork1_~myidx~1=v_qrcu_reader2Thread1of1ForFork1_~myidx~1_93, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond=v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond_47, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx=v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx_25, qrcu_reader2Thread1of1ForFork1_#t~nondet14=|v_qrcu_reader2Thread1of1ForFork1_#t~nondet14_57|, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx=|v_qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx_25|, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond=|v_qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond_47|, ~ctr2~0=v_~ctr2~0_398} AuxVars[] AssignedVars[qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post6, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_~cond, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx, qrcu_reader2Thread1of1ForFork1_#t~nondet14, qrcu_reader2Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx, qrcu_reader2Thread1of1ForFork1_assume_abort_if_not_#in~cond, ~ctr2~0][171], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 647#(= ~readerprogress1~0 2), 519#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0), 138#L770-1true, 714#(<= 1 ~ctr2~0), Black: 710#true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 712#(= ~ctr2~0 0), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 713#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 718#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, Black: 352#(= ~readerprogress1~0 0), Black: 674#(= ~readerprogress2~0 2), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), 45#L744-3true, Black: 554#true, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), 636#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:50:59,164 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-03-25 22:50:59,164 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-25 22:50:59,164 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-25 22:50:59,165 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-03-25 22:50:59,305 INFO L129 PetriNetUnfolder]: 1386/3935 cut-off events. [2021-03-25 22:50:59,305 INFO L130 PetriNetUnfolder]: For 12455/12736 co-relation queries the response was YES. [2021-03-25 22:50:59,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12751 conditions, 3935 events. 1386/3935 cut-off events. For 12455/12736 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 39569 event pairs, 78 based on Foata normal form. 59/3734 useless extension candidates. Maximal degree in co-relation 11842. Up to 479 conditions per place. [2021-03-25 22:50:59,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 6146 [2021-03-25 22:51:01,381 INFO L154 LiptonReduction]: Checked pairs total: 1731 [2021-03-25 22:51:01,381 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:01,381 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2398 [2021-03-25 22:51:01,383 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 184 transitions, 1457 flow [2021-03-25 22:51:01,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 253.4) internal successors, (1267), 5 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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 22:51:01,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:01,384 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 22:51:01,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 22:51:01,384 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 22:51:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1397082069, now seen corresponding path program 1 times [2021-03-25 22:51:01,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:01,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496209688] [2021-03-25 22:51:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:01,423 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:01,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:01,429 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:01,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:01,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:01,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 22:51:01,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:01,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 22:51:01,444 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 22:51:01,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496209688] [2021-03-25 22:51:01,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:01,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:51:01,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263479232] [2021-03-25 22:51:01,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:51:01,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:51:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:51:01,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 302 [2021-03-25 22:51:01,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 184 transitions, 1457 flow. Second operand has 6 states, 6 states have (on average 160.66666666666666) internal successors, (964), 6 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:01,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:01,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 302 [2021-03-25 22:51:01,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:06,211 INFO L129 PetriNetUnfolder]: 32996/49133 cut-off events. [2021-03-25 22:51:06,212 INFO L130 PetriNetUnfolder]: For 116853/118398 co-relation queries the response was YES. [2021-03-25 22:51:06,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165514 conditions, 49133 events. 32996/49133 cut-off events. For 116853/118398 co-relation queries the response was YES. Maximal size of possible extension queue 2142. Compared 372306 event pairs, 2695 based on Foata normal form. 703/39451 useless extension candidates. Maximal degree in co-relation 150320. Up to 25258 conditions per place. [2021-03-25 22:51:06,539 INFO L132 encePairwiseOnDemand]: 285/302 looper letters, 201 selfloop transitions, 16 changer transitions 174/425 dead transitions. [2021-03-25 22:51:06,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 425 transitions, 3608 flow [2021-03-25 22:51:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:51:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:51:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1649 transitions. [2021-03-25 22:51:06,543 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6066961000735835 [2021-03-25 22:51:06,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1649 transitions. [2021-03-25 22:51:06,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1649 transitions. [2021-03-25 22:51:06,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:06,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1649 transitions. [2021-03-25 22:51:06,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 183.22222222222223) internal successors, (1649), 9 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states 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 22:51:06,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states 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 22:51:06,550 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states 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 22:51:06,550 INFO L185 Difference]: Start difference. First operand has 121 places, 184 transitions, 1457 flow. Second operand 9 states and 1649 transitions. [2021-03-25 22:51:06,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 425 transitions, 3608 flow [2021-03-25 22:51:08,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 425 transitions, 3540 flow, removed 34 selfloop flow, removed 0 redundant places. [2021-03-25 22:51:08,362 INFO L241 Difference]: Finished difference. Result has 134 places, 119 transitions, 834 flow [2021-03-25 22:51:08,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=834, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2021-03-25 22:51:08,362 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2021-03-25 22:51:08,362 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:08,362 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 119 transitions, 834 flow [2021-03-25 22:51:08,362 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 119 transitions, 834 flow [2021-03-25 22:51:08,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 119 transitions, 834 flow [2021-03-25 22:51:08,509 INFO L129 PetriNetUnfolder]: 607/1974 cut-off events. [2021-03-25 22:51:08,509 INFO L130 PetriNetUnfolder]: For 4614/4736 co-relation queries the response was YES. [2021-03-25 22:51:08,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 1974 events. 607/1974 cut-off events. For 4614/4736 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18069 event pairs, 33 based on Foata normal form. 28/1890 useless extension candidates. Maximal degree in co-relation 5918. Up to 261 conditions per place. [2021-03-25 22:51:08,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 3704 [2021-03-25 22:51:08,925 INFO L154 LiptonReduction]: Checked pairs total: 1702 [2021-03-25 22:51:08,925 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 22:51:08,925 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 563 [2021-03-25 22:51:08,926 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 117 transitions, 826 flow [2021-03-25 22:51:08,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 160.66666666666666) internal successors, (964), 6 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:08,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:08,927 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 22:51:08,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 22:51:08,927 INFO L428 AbstractCegarLoop]: === Iteration 13 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 22:51:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1724369681, now seen corresponding path program 1 times [2021-03-25 22:51:08,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:08,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818380956] [2021-03-25 22:51:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:08,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:08,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:08,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:08,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:08,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:08,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:51:08,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818380956] [2021-03-25 22:51:08,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:08,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 22:51:08,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407654910] [2021-03-25 22:51:08,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:51:08,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:51:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:51:08,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 304 [2021-03-25 22:51:08,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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 22:51:08,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:08,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 304 [2021-03-25 22:51:08,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:09,108 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][76], [Black: 633#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 638#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 0) (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), 516#true, 710#true, 647#(= ~readerprogress1~0 2), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 522#(and (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 712#(= ~ctr2~0 0), Black: 713#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), Black: 524#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= ~readerprogress1~0 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0) (= ~readerprogress2~0 0)), Black: 526#(and (= |qrcu_updaterThread1of1ForFork2_#t~mem22| 0) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart1~0.offset|) 0)), Black: 714#(<= 1 ~ctr2~0), Black: 718#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 21#L786-2true, Black: 595#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (<= 2 ~ctr1~0)), Black: 591#true, 795#(and (not (= ~readerprogress2~0 1)) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1))), Black: 784#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 786#(not (= ~readerprogress2~0 1)), Black: 787#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 791#(and (<= ~idx~0 0) (= ~ctr1~0 1) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)) (= ~readerprogress2~0 0)), 674#(= ~readerprogress2~0 2), Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 554#true, 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 169#(<= qrcu_updaterThread1of1ForFork2_~sum~0 1), Black: 171#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), 631#true, Black: 438#(= ~readerprogress2~0 0), 890#true, Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:51:09,108 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 22:51:09,108 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 22:51:09,108 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-25 22:51:09,108 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 22:51:09,222 INFO L129 PetriNetUnfolder]: 1171/3086 cut-off events. [2021-03-25 22:51:09,222 INFO L130 PetriNetUnfolder]: For 6719/6831 co-relation queries the response was YES. [2021-03-25 22:51:09,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9979 conditions, 3086 events. 1171/3086 cut-off events. For 6719/6831 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 27379 event pairs, 86 based on Foata normal form. 25/2665 useless extension candidates. Maximal degree in co-relation 9595. Up to 554 conditions per place. [2021-03-25 22:51:09,251 INFO L132 encePairwiseOnDemand]: 302/304 looper letters, 28 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2021-03-25 22:51:09,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 126 transitions, 930 flow [2021-03-25 22:51:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:51:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:51:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2021-03-25 22:51:09,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9024122807017544 [2021-03-25 22:51:09,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 823 transitions. [2021-03-25 22:51:09,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 823 transitions. [2021-03-25 22:51:09,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:09,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 823 transitions. [2021-03-25 22:51:09,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 22:51:09,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:09,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:09,256 INFO L185 Difference]: Start difference. First operand has 119 places, 117 transitions, 826 flow. Second operand 3 states and 823 transitions. [2021-03-25 22:51:09,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 126 transitions, 930 flow [2021-03-25 22:51:09,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 126 transitions, 799 flow, removed 44 selfloop flow, removed 17 redundant places. [2021-03-25 22:51:09,291 INFO L241 Difference]: Finished difference. Result has 105 places, 117 transitions, 722 flow [2021-03-25 22:51:09,291 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2021-03-25 22:51:09,291 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2021-03-25 22:51:09,292 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:09,292 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 117 transitions, 722 flow [2021-03-25 22:51:09,292 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 117 transitions, 722 flow [2021-03-25 22:51:09,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 117 transitions, 722 flow [2021-03-25 22:51:09,412 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([914] L767-10-->L770-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex~0.base_22|))) (and (= (select .cse0 |v_~#mutex~0.offset_22|) 0) (= |v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7| 0) (= (store |v_#pthreadsMutex_16| |v_~#mutex~0.base_22| (store .cse0 |v_~#mutex~0.offset_22| 1)) |v_#pthreadsMutex_15|) (< 1 v_qrcu_updaterThread1of1ForFork2_~sum~0_51))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex~0.base=|v_~#mutex~0.base_22|, ~#mutex~0.offset=|v_~#mutex~0.offset_22|, qrcu_updaterThread1of1ForFork2_#t~nondet17=|v_qrcu_updaterThread1of1ForFork2_#t~nondet17_7|, qrcu_updaterThread1of1ForFork2_~sum~0=v_qrcu_updaterThread1of1ForFork2_~sum~0_51} AuxVars[] AssignedVars[#pthreadsMutex, qrcu_updaterThread1of1ForFork2_#t~nondet17][93], [710#true, 647#(= ~readerprogress1~0 2), 138#L770-1true, Black: 518#(and (= ~readerprogress1~0 0) (= ~readerprogress2~0 0)), Black: 712#(= ~ctr2~0 0), Black: 713#(= |qrcu_updaterThread1of1ForFork2_#t~post18| 0), 786#(not (= ~readerprogress2~0 1)), Black: 714#(<= 1 ~ctr2~0), 596#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 718#(and (<= 1 ~ctr2~0) (= |qrcu_updaterThread1of1ForFork2_#t~post18| 0)), 21#L786-2true, Black: 784#(and (<= ~idx~0 0) (= ~ctr1~0 1) (= ~readerprogress2~0 0)), Black: 787#(not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1)), Black: 795#(and (not (= ~readerprogress2~0 1)) (not (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.base|) |qrcu_updaterThread1of1ForFork2_~#readerstart2~0.offset|) 1))), 674#(= ~readerprogress2~0 2), Black: 352#(= ~readerprogress1~0 0), 100#qrcu_reader1EXITtrue, 165#true, 556#(< 1 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 554#true, 110#qrcu_reader2EXITtrue, Black: 167#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 173#(and (<= qrcu_updaterThread1of1ForFork2_~sum~0 1) (= ~ctr2~0 0) (= ~ctr1~0 1)), 565#(<= 2 qrcu_updaterThread1of1ForFork2_~sum~0), Black: 438#(= ~readerprogress2~0 0), 890#true, Black: 560#true, Black: 563#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 567#(and (= qrcu_updaterThread1of1ForFork2_~sum~0 0) (= ~ctr2~0 0) (<= 2 ~ctr1~0)), Black: 892#(= ~idx~0 1), Black: 569#(and (= ~ctr2~0 0) (<= 2 ~ctr1~0) (<= 2 qrcu_updaterThread1of1ForFork2_~sum~0))]) [2021-03-25 22:51:09,412 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-25 22:51:09,412 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-25 22:51:09,412 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-25 22:51:09,412 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-25 22:51:09,467 INFO L129 PetriNetUnfolder]: 701/2399 cut-off events. [2021-03-25 22:51:09,467 INFO L130 PetriNetUnfolder]: For 4124/4181 co-relation queries the response was YES. [2021-03-25 22:51:09,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2399 events. 701/2399 cut-off events. For 4124/4181 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23343 event pairs, 26 based on Foata normal form. 19/2324 useless extension candidates. Maximal degree in co-relation 6294. Up to 335 conditions per place. [2021-03-25 22:51:09,502 INFO L142 LiptonReduction]: Number of co-enabled transitions 3426 [2021-03-25 22:51:09,745 INFO L154 LiptonReduction]: Checked pairs total: 802 [2021-03-25 22:51:09,745 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:09,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 453 [2021-03-25 22:51:09,746 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 722 flow [2021-03-25 22:51:09,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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 22:51:09,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:09,747 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 22:51:09,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 22:51:09,747 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 22:51:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:09,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1091578131, now seen corresponding path program 1 times [2021-03-25 22:51:09,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:09,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343374487] [2021-03-25 22:51:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:09,781 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:09,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:09,787 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:09,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:09,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:09,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:09,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:09,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:09,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:09,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:09,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:09,832 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 22:51:09,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343374487] [2021-03-25 22:51:09,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:09,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:51:09,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124846898] [2021-03-25 22:51:09,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:51:09,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:51:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:51:09,837 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 304 [2021-03-25 22:51:09,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 722 flow. Second operand has 9 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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 22:51:09,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:09,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 304 [2021-03-25 22:51:09,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:10,575 INFO L129 PetriNetUnfolder]: 3313/5703 cut-off events. [2021-03-25 22:51:10,575 INFO L130 PetriNetUnfolder]: For 11654/11665 co-relation queries the response was YES. [2021-03-25 22:51:10,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19361 conditions, 5703 events. 3313/5703 cut-off events. For 11654/11665 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38287 event pairs, 135 based on Foata normal form. 23/4330 useless extension candidates. Maximal degree in co-relation 19024. Up to 3063 conditions per place. [2021-03-25 22:51:10,606 INFO L132 encePairwiseOnDemand]: 283/304 looper letters, 163 selfloop transitions, 67 changer transitions 18/271 dead transitions. [2021-03-25 22:51:10,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 271 transitions, 1984 flow [2021-03-25 22:51:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 22:51:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 22:51:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2958 transitions. [2021-03-25 22:51:10,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6486842105263158 [2021-03-25 22:51:10,612 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2958 transitions. [2021-03-25 22:51:10,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2958 transitions. [2021-03-25 22:51:10,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:10,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2958 transitions. [2021-03-25 22:51:10,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 197.2) internal successors, (2958), 15 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states 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 22:51:10,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 304.0) internal successors, (4864), 16 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states 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 22:51:10,623 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 304.0) internal successors, (4864), 16 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states 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 22:51:10,623 INFO L185 Difference]: Start difference. First operand has 105 places, 117 transitions, 722 flow. Second operand 15 states and 2958 transitions. [2021-03-25 22:51:10,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 271 transitions, 1984 flow [2021-03-25 22:51:10,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 271 transitions, 1969 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 22:51:10,672 INFO L241 Difference]: Finished difference. Result has 123 places, 166 transitions, 1242 flow [2021-03-25 22:51:10,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1242, PETRI_PLACES=123, PETRI_TRANSITIONS=166} [2021-03-25 22:51:10,672 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2021-03-25 22:51:10,672 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:10,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 166 transitions, 1242 flow [2021-03-25 22:51:10,672 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 166 transitions, 1242 flow [2021-03-25 22:51:10,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 166 transitions, 1242 flow [2021-03-25 22:51:10,814 INFO L129 PetriNetUnfolder]: 715/2093 cut-off events. [2021-03-25 22:51:10,814 INFO L130 PetriNetUnfolder]: For 5580/5684 co-relation queries the response was YES. [2021-03-25 22:51:10,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6803 conditions, 2093 events. 715/2093 cut-off events. For 5580/5684 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18321 event pairs, 45 based on Foata normal form. 34/1951 useless extension candidates. Maximal degree in co-relation 6413. Up to 276 conditions per place. [2021-03-25 22:51:10,839 INFO L142 LiptonReduction]: Number of co-enabled transitions 3692 [2021-03-25 22:51:11,167 INFO L154 LiptonReduction]: Checked pairs total: 1706 [2021-03-25 22:51:11,167 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 22:51:11,167 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 495 [2021-03-25 22:51:11,168 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 165 transitions, 1241 flow [2021-03-25 22:51:11,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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 22:51:11,169 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:11,169 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 22:51:11,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 22:51:11,169 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 22:51:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash -115372328, now seen corresponding path program 1 times [2021-03-25 22:51:11,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:11,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782543020] [2021-03-25 22:51:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:11,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:11,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:51:11,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782543020] [2021-03-25 22:51:11,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:11,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 22:51:11,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757216760] [2021-03-25 22:51:11,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 22:51:11,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 22:51:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 22:51:11,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 306 [2021-03-25 22:51:11,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 165 transitions, 1241 flow. Second operand has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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 22:51:11,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:11,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 306 [2021-03-25 22:51:11,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:11,366 INFO L129 PetriNetUnfolder]: 735/2049 cut-off events. [2021-03-25 22:51:11,366 INFO L130 PetriNetUnfolder]: For 5994/6099 co-relation queries the response was YES. [2021-03-25 22:51:11,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 2049 events. 735/2049 cut-off events. For 5994/6099 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17361 event pairs, 90 based on Foata normal form. 97/1839 useless extension candidates. Maximal degree in co-relation 7415. Up to 304 conditions per place. [2021-03-25 22:51:11,379 INFO L132 encePairwiseOnDemand]: 303/306 looper letters, 39 selfloop transitions, 4 changer transitions 1/157 dead transitions. [2021-03-25 22:51:11,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 157 transitions, 1297 flow [2021-03-25 22:51:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 22:51:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 22:51:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2021-03-25 22:51:11,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8965141612200436 [2021-03-25 22:51:11,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 823 transitions. [2021-03-25 22:51:11,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 823 transitions. [2021-03-25 22:51:11,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:11,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 823 transitions. [2021-03-25 22:51:11,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states 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 22:51:11,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 22:51:11,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 22:51:11,385 INFO L185 Difference]: Start difference. First operand has 122 places, 165 transitions, 1241 flow. Second operand 3 states and 823 transitions. [2021-03-25 22:51:11,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 157 transitions, 1297 flow [2021-03-25 22:51:11,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 157 transitions, 1254 flow, removed 20 selfloop flow, removed 1 redundant places. [2021-03-25 22:51:11,419 INFO L241 Difference]: Finished difference. Result has 118 places, 148 transitions, 1113 flow [2021-03-25 22:51:11,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=118, PETRI_TRANSITIONS=148} [2021-03-25 22:51:11,419 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 40 predicate places. [2021-03-25 22:51:11,420 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:11,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 148 transitions, 1113 flow [2021-03-25 22:51:11,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 148 transitions, 1113 flow [2021-03-25 22:51:11,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 148 transitions, 1113 flow [2021-03-25 22:51:11,500 INFO L129 PetriNetUnfolder]: 469/1432 cut-off events. [2021-03-25 22:51:11,501 INFO L130 PetriNetUnfolder]: For 4322/4412 co-relation queries the response was YES. [2021-03-25 22:51:11,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1432 events. 469/1432 cut-off events. For 4322/4412 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12029 event pairs, 40 based on Foata normal form. 21/1327 useless extension candidates. Maximal degree in co-relation 4746. Up to 191 conditions per place. [2021-03-25 22:51:11,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 2878 [2021-03-25 22:51:11,637 INFO L154 LiptonReduction]: Checked pairs total: 1122 [2021-03-25 22:51:11,637 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 22:51:11,637 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-03-25 22:51:11,638 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 148 transitions, 1114 flow [2021-03-25 22:51:11,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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 22:51:11,638 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:11,638 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 22:51:11,638 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 22:51:11,639 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 22:51:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1783103871, now seen corresponding path program 1 times [2021-03-25 22:51:11,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:11,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487748778] [2021-03-25 22:51:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:11,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:11,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:11,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 22:51:11,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:11,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:11,688 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 22:51:11,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487748778] [2021-03-25 22:51:11,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:11,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:51:11,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9184223] [2021-03-25 22:51:11,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:51:11,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:51:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:51:11,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 307 [2021-03-25 22:51:11,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 148 transitions, 1114 flow. Second operand has 6 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states 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 22:51:11,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:11,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 307 [2021-03-25 22:51:11,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:12,310 INFO L129 PetriNetUnfolder]: 2497/6217 cut-off events. [2021-03-25 22:51:12,310 INFO L130 PetriNetUnfolder]: For 17988/18513 co-relation queries the response was YES. [2021-03-25 22:51:12,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23302 conditions, 6217 events. 2497/6217 cut-off events. For 17988/18513 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 60326 event pairs, 417 based on Foata normal form. 157/5802 useless extension candidates. Maximal degree in co-relation 22483. Up to 1207 conditions per place. [2021-03-25 22:51:12,343 INFO L132 encePairwiseOnDemand]: 297/307 looper letters, 43 selfloop transitions, 22 changer transitions 2/190 dead transitions. [2021-03-25 22:51:12,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 190 transitions, 1412 flow [2021-03-25 22:51:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:51:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:51:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2050 transitions. [2021-03-25 22:51:12,347 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7419471588852696 [2021-03-25 22:51:12,347 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2050 transitions. [2021-03-25 22:51:12,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2050 transitions. [2021-03-25 22:51:12,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:12,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2050 transitions. [2021-03-25 22:51:12,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 227.77777777777777) internal successors, (2050), 9 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states 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 22:51:12,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 307.0) internal successors, (3070), 10 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states 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 22:51:12,354 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 307.0) internal successors, (3070), 10 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states 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 22:51:12,354 INFO L185 Difference]: Start difference. First operand has 118 places, 148 transitions, 1114 flow. Second operand 9 states and 2050 transitions. [2021-03-25 22:51:12,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 190 transitions, 1412 flow [2021-03-25 22:51:12,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 190 transitions, 1404 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 22:51:12,472 INFO L241 Difference]: Finished difference. Result has 128 places, 166 transitions, 1298 flow [2021-03-25 22:51:12,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1298, PETRI_PLACES=128, PETRI_TRANSITIONS=166} [2021-03-25 22:51:12,472 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 50 predicate places. [2021-03-25 22:51:12,472 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:12,472 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 166 transitions, 1298 flow [2021-03-25 22:51:12,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 166 transitions, 1298 flow [2021-03-25 22:51:12,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 166 transitions, 1298 flow [2021-03-25 22:51:12,575 INFO L129 PetriNetUnfolder]: 562/1794 cut-off events. [2021-03-25 22:51:12,575 INFO L130 PetriNetUnfolder]: For 5320/5440 co-relation queries the response was YES. [2021-03-25 22:51:12,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6254 conditions, 1794 events. 562/1794 cut-off events. For 5320/5440 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16289 event pairs, 34 based on Foata normal form. 29/1682 useless extension candidates. Maximal degree in co-relation 5874. Up to 211 conditions per place. [2021-03-25 22:51:12,596 INFO L142 LiptonReduction]: Number of co-enabled transitions 3098 [2021-03-25 22:51:12,708 INFO L154 LiptonReduction]: Checked pairs total: 804 [2021-03-25 22:51:12,708 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:12,708 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 236 [2021-03-25 22:51:12,709 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 166 transitions, 1298 flow [2021-03-25 22:51:12,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 222.66666666666666) internal successors, (1336), 6 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states 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 22:51:12,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:12,710 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 22:51:12,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 22:51:12,710 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 22:51:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash -275653185, now seen corresponding path program 1 times [2021-03-25 22:51:12,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:12,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567082085] [2021-03-25 22:51:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:12,737 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:12,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:12,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:12,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:12,746 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-25 22:51:12,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:12,755 INFO L142 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-03-25 22:51:12,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:12,759 INFO L142 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-03-25 22:51:12,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:12,764 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-03-25 22:51:12,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:12,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:12,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:12,769 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 22:51:12,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567082085] [2021-03-25 22:51:12,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:12,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:51:12,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607310869] [2021-03-25 22:51:12,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:51:12,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:12,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:51:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:51:12,771 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 307 [2021-03-25 22:51:12,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 166 transitions, 1298 flow. Second operand has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:12,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:12,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 307 [2021-03-25 22:51:12,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:13,413 INFO L129 PetriNetUnfolder]: 1202/3466 cut-off events. [2021-03-25 22:51:13,413 INFO L130 PetriNetUnfolder]: For 13379/13577 co-relation queries the response was YES. [2021-03-25 22:51:13,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13588 conditions, 3466 events. 1202/3466 cut-off events. For 13379/13577 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 32709 event pairs, 37 based on Foata normal form. 168/3455 useless extension candidates. Maximal degree in co-relation 13104. Up to 532 conditions per place. [2021-03-25 22:51:13,433 INFO L132 encePairwiseOnDemand]: 283/307 looper letters, 77 selfloop transitions, 70 changer transitions 73/282 dead transitions. [2021-03-25 22:51:13,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 282 transitions, 2752 flow [2021-03-25 22:51:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 22:51:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 22:51:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3274 transitions. [2021-03-25 22:51:13,438 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7109663409337676 [2021-03-25 22:51:13,438 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3274 transitions. [2021-03-25 22:51:13,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3274 transitions. [2021-03-25 22:51:13,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:13,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3274 transitions. [2021-03-25 22:51:13,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 218.26666666666668) internal successors, (3274), 15 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 22:51:13,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:13,449 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 307.0) internal successors, (4912), 16 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:13,449 INFO L185 Difference]: Start difference. First operand has 128 places, 166 transitions, 1298 flow. Second operand 15 states and 3274 transitions. [2021-03-25 22:51:13,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 282 transitions, 2752 flow [2021-03-25 22:51:13,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 282 transitions, 2596 flow, removed 78 selfloop flow, removed 0 redundant places. [2021-03-25 22:51:13,529 INFO L241 Difference]: Finished difference. Result has 149 places, 183 transitions, 1626 flow [2021-03-25 22:51:13,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1626, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2021-03-25 22:51:13,529 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 71 predicate places. [2021-03-25 22:51:13,529 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:13,530 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions, 1626 flow [2021-03-25 22:51:13,530 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 183 transitions, 1626 flow [2021-03-25 22:51:13,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions, 1626 flow [2021-03-25 22:51:13,662 INFO L129 PetriNetUnfolder]: 573/2133 cut-off events. [2021-03-25 22:51:13,662 INFO L130 PetriNetUnfolder]: For 7776/7885 co-relation queries the response was YES. [2021-03-25 22:51:13,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8115 conditions, 2133 events. 573/2133 cut-off events. For 7776/7885 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20921 event pairs, 20 based on Foata normal form. 29/2027 useless extension candidates. Maximal degree in co-relation 7825. Up to 246 conditions per place. [2021-03-25 22:51:13,686 INFO L142 LiptonReduction]: Number of co-enabled transitions 3100 [2021-03-25 22:51:14,032 INFO L154 LiptonReduction]: Checked pairs total: 1397 [2021-03-25 22:51:14,032 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 22:51:14,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 503 [2021-03-25 22:51:14,033 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 1626 flow [2021-03-25 22:51:14,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:14,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:14,033 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 22:51:14,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 22:51:14,034 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 22:51:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -870477244, now seen corresponding path program 1 times [2021-03-25 22:51:14,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:14,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490524048] [2021-03-25 22:51:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:14,062 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:14,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:14,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:14,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:14,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:14,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:14,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:51:14,112 INFO L142 QuantifierPusher]: treesize reduction 20, result has 4.8 percent of original size [2021-03-25 22:51:14,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:14,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:14,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:14,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 22:51:14,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490524048] [2021-03-25 22:51:14,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:14,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:51:14,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846974884] [2021-03-25 22:51:14,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:51:14,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:51:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:51:14,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 308 [2021-03-25 22:51:14,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 183 transitions, 1626 flow. Second operand has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:14,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:14,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 308 [2021-03-25 22:51:14,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:14,631 INFO L129 PetriNetUnfolder]: 904/2850 cut-off events. [2021-03-25 22:51:14,632 INFO L130 PetriNetUnfolder]: For 13177/13359 co-relation queries the response was YES. [2021-03-25 22:51:14,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12305 conditions, 2850 events. 904/2850 cut-off events. For 13177/13359 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 27050 event pairs, 68 based on Foata normal form. 62/2733 useless extension candidates. Maximal degree in co-relation 11952. Up to 701 conditions per place. [2021-03-25 22:51:14,650 INFO L132 encePairwiseOnDemand]: 292/308 looper letters, 96 selfloop transitions, 43 changer transitions 20/221 dead transitions. [2021-03-25 22:51:14,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 221 transitions, 2263 flow [2021-03-25 22:51:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 22:51:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 22:51:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2167 transitions. [2021-03-25 22:51:14,652 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7035714285714286 [2021-03-25 22:51:14,652 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2167 transitions. [2021-03-25 22:51:14,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2167 transitions. [2021-03-25 22:51:14,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:14,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2167 transitions. [2021-03-25 22:51:14,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 216.7) internal successors, (2167), 10 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states 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 22:51:14,657 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 22:51:14,657 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 22:51:14,657 INFO L185 Difference]: Start difference. First operand has 149 places, 183 transitions, 1626 flow. Second operand 10 states and 2167 transitions. [2021-03-25 22:51:14,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 221 transitions, 2263 flow [2021-03-25 22:51:14,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 221 transitions, 2090 flow, removed 59 selfloop flow, removed 7 redundant places. [2021-03-25 22:51:14,769 INFO L241 Difference]: Finished difference. Result has 154 places, 181 transitions, 1616 flow [2021-03-25 22:51:14,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1616, PETRI_PLACES=154, PETRI_TRANSITIONS=181} [2021-03-25 22:51:14,770 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2021-03-25 22:51:14,770 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:14,770 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 181 transitions, 1616 flow [2021-03-25 22:51:14,770 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 181 transitions, 1616 flow [2021-03-25 22:51:14,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 181 transitions, 1616 flow [2021-03-25 22:51:14,922 INFO L129 PetriNetUnfolder]: 598/2238 cut-off events. [2021-03-25 22:51:14,922 INFO L130 PetriNetUnfolder]: For 8813/8890 co-relation queries the response was YES. [2021-03-25 22:51:14,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8441 conditions, 2238 events. 598/2238 cut-off events. For 8813/8890 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22233 event pairs, 18 based on Foata normal form. 31/2124 useless extension candidates. Maximal degree in co-relation 8182. Up to 242 conditions per place. [2021-03-25 22:51:14,950 INFO L142 LiptonReduction]: Number of co-enabled transitions 3084 [2021-03-25 22:51:15,405 INFO L154 LiptonReduction]: Checked pairs total: 1694 [2021-03-25 22:51:15,405 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 22:51:15,405 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 635 [2021-03-25 22:51:15,406 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 180 transitions, 1611 flow [2021-03-25 22:51:15,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:15,407 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:15,407 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 22:51:15,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 22:51:15,407 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 22:51:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -393717816, now seen corresponding path program 2 times [2021-03-25 22:51:15,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:15,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049023960] [2021-03-25 22:51:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:15,433 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:15,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:15,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:15,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:15,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:15,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:15,448 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-25 22:51:15,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:15,458 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-25 22:51:15,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 22:51:15,467 INFO L142 QuantifierPusher]: treesize reduction 6, result has 77.8 percent of original size [2021-03-25 22:51:15,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 22:51:15,480 INFO L142 QuantifierPusher]: treesize reduction 26, result has 3.7 percent of original size [2021-03-25 22:51:15,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:15,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:15,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:15,481 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 22:51:15,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049023960] [2021-03-25 22:51:15,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:15,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 22:51:15,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836124004] [2021-03-25 22:51:15,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 22:51:15,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 22:51:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 22:51:15,486 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 310 [2021-03-25 22:51:15,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 180 transitions, 1611 flow. Second operand has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:15,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:15,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 310 [2021-03-25 22:51:15,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:16,043 INFO L129 PetriNetUnfolder]: 894/2873 cut-off events. [2021-03-25 22:51:16,043 INFO L130 PetriNetUnfolder]: For 14999/15123 co-relation queries the response was YES. [2021-03-25 22:51:16,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 2873 events. 894/2873 cut-off events. For 14999/15123 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 27561 event pairs, 67 based on Foata normal form. 73/2756 useless extension candidates. Maximal degree in co-relation 12481. Up to 1112 conditions per place. [2021-03-25 22:51:16,066 INFO L132 encePairwiseOnDemand]: 291/310 looper letters, 114 selfloop transitions, 58 changer transitions 6/240 dead transitions. [2021-03-25 22:51:16,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 240 transitions, 2521 flow [2021-03-25 22:51:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 22:51:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 22:51:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2387 transitions. [2021-03-25 22:51:16,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7 [2021-03-25 22:51:16,068 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2387 transitions. [2021-03-25 22:51:16,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2387 transitions. [2021-03-25 22:51:16,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:16,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2387 transitions. [2021-03-25 22:51:16,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states 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 22:51:16,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states 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 22:51:16,074 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states 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 22:51:16,074 INFO L185 Difference]: Start difference. First operand has 153 places, 180 transitions, 1611 flow. Second operand 11 states and 2387 transitions. [2021-03-25 22:51:16,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 240 transitions, 2521 flow [2021-03-25 22:51:16,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 240 transitions, 2446 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-25 22:51:16,161 INFO L241 Difference]: Finished difference. Result has 162 places, 197 transitions, 1917 flow [2021-03-25 22:51:16,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1917, PETRI_PLACES=162, PETRI_TRANSITIONS=197} [2021-03-25 22:51:16,161 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 84 predicate places. [2021-03-25 22:51:16,161 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:16,161 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 197 transitions, 1917 flow [2021-03-25 22:51:16,162 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 197 transitions, 1917 flow [2021-03-25 22:51:16,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 197 transitions, 1917 flow [2021-03-25 22:51:16,339 INFO L129 PetriNetUnfolder]: 522/1929 cut-off events. [2021-03-25 22:51:16,339 INFO L130 PetriNetUnfolder]: For 9865/9945 co-relation queries the response was YES. [2021-03-25 22:51:16,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1929 events. 522/1929 cut-off events. For 9865/9945 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18442 event pairs, 24 based on Foata normal form. 41/1843 useless extension candidates. Maximal degree in co-relation 7332. Up to 208 conditions per place. [2021-03-25 22:51:16,360 INFO L142 LiptonReduction]: Number of co-enabled transitions 3176 [2021-03-25 22:51:16,483 INFO L154 LiptonReduction]: Checked pairs total: 1024 [2021-03-25 22:51:16,483 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:16,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 322 [2021-03-25 22:51:16,484 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 197 transitions, 1917 flow [2021-03-25 22:51:16,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 209.375) internal successors, (1675), 8 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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 22:51:16,485 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:16,485 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 22:51:16,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 22:51:16,485 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 22:51:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1590510807, now seen corresponding path program 1 times [2021-03-25 22:51:16,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:16,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890492811] [2021-03-25 22:51:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:16,510 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:16,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:16,516 INFO L142 QuantifierPusher]: treesize reduction 2, result has 83.3 percent of original size [2021-03-25 22:51:16,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:16,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:16,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 22:51:16,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:16,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:16,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:16,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:16,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:16,554 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 22:51:16,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890492811] [2021-03-25 22:51:16,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:16,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 22:51:16,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451206290] [2021-03-25 22:51:16,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 22:51:16,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 22:51:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-25 22:51:16,557 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 310 [2021-03-25 22:51:16,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 197 transitions, 1917 flow. Second operand has 9 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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 22:51:16,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:16,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 310 [2021-03-25 22:51:16,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:17,229 INFO L129 PetriNetUnfolder]: 1928/4050 cut-off events. [2021-03-25 22:51:17,229 INFO L130 PetriNetUnfolder]: For 22394/22445 co-relation queries the response was YES. [2021-03-25 22:51:17,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18792 conditions, 4050 events. 1928/4050 cut-off events. For 22394/22445 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 31039 event pairs, 95 based on Foata normal form. 67/3287 useless extension candidates. Maximal degree in co-relation 18547. Up to 1459 conditions per place. [2021-03-25 22:51:17,254 INFO L132 encePairwiseOnDemand]: 287/310 looper letters, 156 selfloop transitions, 73 changer transitions 59/315 dead transitions. [2021-03-25 22:51:17,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 315 transitions, 3377 flow [2021-03-25 22:51:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-25 22:51:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-03-25 22:51:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2938 transitions. [2021-03-25 22:51:17,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6318279569892473 [2021-03-25 22:51:17,256 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2938 transitions. [2021-03-25 22:51:17,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2938 transitions. [2021-03-25 22:51:17,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:17,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2938 transitions. [2021-03-25 22:51:17,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 195.86666666666667) internal successors, (2938), 15 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states 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 22:51:17,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 310.0) internal successors, (4960), 16 states have internal predecessors, (4960), 0 states have call successors, (0), 0 states 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 22:51:17,262 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 310.0) internal successors, (4960), 16 states have internal predecessors, (4960), 0 states have call successors, (0), 0 states 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 22:51:17,262 INFO L185 Difference]: Start difference. First operand has 162 places, 197 transitions, 1917 flow. Second operand 15 states and 2938 transitions. [2021-03-25 22:51:17,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 315 transitions, 3377 flow [2021-03-25 22:51:17,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 315 transitions, 3326 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 22:51:17,397 INFO L241 Difference]: Finished difference. Result has 178 places, 183 transitions, 1882 flow [2021-03-25 22:51:17,397 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1882, PETRI_PLACES=178, PETRI_TRANSITIONS=183} [2021-03-25 22:51:17,397 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 100 predicate places. [2021-03-25 22:51:17,397 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:17,397 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 183 transitions, 1882 flow [2021-03-25 22:51:17,397 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 183 transitions, 1882 flow [2021-03-25 22:51:17,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 183 transitions, 1882 flow [2021-03-25 22:51:17,492 INFO L129 PetriNetUnfolder]: 325/1225 cut-off events. [2021-03-25 22:51:17,492 INFO L130 PetriNetUnfolder]: For 6804/6877 co-relation queries the response was YES. [2021-03-25 22:51:17,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4996 conditions, 1225 events. 325/1225 cut-off events. For 6804/6877 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10387 event pairs, 0 based on Foata normal form. 19/1157 useless extension candidates. Maximal degree in co-relation 4829. Up to 149 conditions per place. [2021-03-25 22:51:17,505 INFO L142 LiptonReduction]: Number of co-enabled transitions 2454 [2021-03-25 22:51:18,212 INFO L154 LiptonReduction]: Checked pairs total: 2731 [2021-03-25 22:51:18,213 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 22:51:18,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 816 [2021-03-25 22:51:18,213 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 180 transitions, 1889 flow [2021-03-25 22:51:18,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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 22:51:18,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:18,214 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 22:51:18,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 22:51:18,214 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 22:51:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1445886869, now seen corresponding path program 1 times [2021-03-25 22:51:18,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:18,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515698258] [2021-03-25 22:51:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:18,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:18,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:18,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:18,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:18,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:18,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:18,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:18,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:18,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:18,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 22:51:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:51:18,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515698258] [2021-03-25 22:51:18,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:18,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:51:18,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658301044] [2021-03-25 22:51:18,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:51:18,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:51:18,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:51:18,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 320 [2021-03-25 22:51:18,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 180 transitions, 1889 flow. Second operand has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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 22:51:18,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:18,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 320 [2021-03-25 22:51:18,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:18,607 INFO L129 PetriNetUnfolder]: 745/1793 cut-off events. [2021-03-25 22:51:18,607 INFO L130 PetriNetUnfolder]: For 10589/10705 co-relation queries the response was YES. [2021-03-25 22:51:18,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8525 conditions, 1793 events. 745/1793 cut-off events. For 10589/10705 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13058 event pairs, 41 based on Foata normal form. 41/1527 useless extension candidates. Maximal degree in co-relation 8353. Up to 432 conditions per place. [2021-03-25 22:51:18,620 INFO L132 encePairwiseOnDemand]: 303/320 looper letters, 118 selfloop transitions, 42 changer transitions 23/256 dead transitions. [2021-03-25 22:51:18,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 256 transitions, 2931 flow [2021-03-25 22:51:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:51:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:51:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1448 transitions. [2021-03-25 22:51:18,621 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7541666666666667 [2021-03-25 22:51:18,621 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1448 transitions. [2021-03-25 22:51:18,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1448 transitions. [2021-03-25 22:51:18,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:18,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1448 transitions. [2021-03-25 22:51:18,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.33333333333334) internal successors, (1448), 6 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 22:51:18,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 320.0) internal successors, (2240), 7 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:18,624 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 320.0) internal successors, (2240), 7 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:18,624 INFO L185 Difference]: Start difference. First operand has 169 places, 180 transitions, 1889 flow. Second operand 6 states and 1448 transitions. [2021-03-25 22:51:18,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 256 transitions, 2931 flow [2021-03-25 22:51:18,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 256 transitions, 2663 flow, removed 37 selfloop flow, removed 22 redundant places. [2021-03-25 22:51:18,667 INFO L241 Difference]: Finished difference. Result has 157 places, 199 transitions, 2073 flow [2021-03-25 22:51:18,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2073, PETRI_PLACES=157, PETRI_TRANSITIONS=199} [2021-03-25 22:51:18,667 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 79 predicate places. [2021-03-25 22:51:18,668 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:18,668 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 199 transitions, 2073 flow [2021-03-25 22:51:18,668 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 199 transitions, 2073 flow [2021-03-25 22:51:18,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 157 places, 199 transitions, 2073 flow [2021-03-25 22:51:18,785 INFO L129 PetriNetUnfolder]: 385/1323 cut-off events. [2021-03-25 22:51:18,786 INFO L130 PetriNetUnfolder]: For 7106/7155 co-relation queries the response was YES. [2021-03-25 22:51:18,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 1323 events. 385/1323 cut-off events. For 7106/7155 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11149 event pairs, 1 based on Foata normal form. 14/1220 useless extension candidates. Maximal degree in co-relation 5425. Up to 207 conditions per place. [2021-03-25 22:51:18,806 INFO L142 LiptonReduction]: Number of co-enabled transitions 2618 [2021-03-25 22:51:19,017 INFO L154 LiptonReduction]: Checked pairs total: 3625 [2021-03-25 22:51:19,017 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 22:51:19,017 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 349 [2021-03-25 22:51:19,018 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 198 transitions, 2071 flow [2021-03-25 22:51:19,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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 22:51:19,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:19,019 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 22:51:19,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 22:51:19,019 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 22:51:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 913087734, now seen corresponding path program 1 times [2021-03-25 22:51:19,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:19,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077766070] [2021-03-25 22:51:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:19,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:19,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:19,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:19,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,077 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 22:51:19,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077766070] [2021-03-25 22:51:19,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:19,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:51:19,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728207134] [2021-03-25 22:51:19,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:51:19,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:51:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:51:19,080 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 321 [2021-03-25 22:51:19,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 198 transitions, 2071 flow. Second operand has 7 states, 7 states have (on average 226.71428571428572) internal successors, (1587), 7 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states 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 22:51:19,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:19,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 321 [2021-03-25 22:51:19,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:19,445 INFO L129 PetriNetUnfolder]: 746/1805 cut-off events. [2021-03-25 22:51:19,445 INFO L130 PetriNetUnfolder]: For 11787/11949 co-relation queries the response was YES. [2021-03-25 22:51:19,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8976 conditions, 1805 events. 746/1805 cut-off events. For 11787/11949 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13273 event pairs, 49 based on Foata normal form. 76/1567 useless extension candidates. Maximal degree in co-relation 8804. Up to 586 conditions per place. [2021-03-25 22:51:19,455 INFO L132 encePairwiseOnDemand]: 305/321 looper letters, 112 selfloop transitions, 41 changer transitions 34/259 dead transitions. [2021-03-25 22:51:19,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 259 transitions, 3092 flow [2021-03-25 22:51:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 22:51:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 22:51:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1671 transitions. [2021-03-25 22:51:19,456 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7436582109479306 [2021-03-25 22:51:19,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1671 transitions. [2021-03-25 22:51:19,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1671 transitions. [2021-03-25 22:51:19,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:19,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1671 transitions. [2021-03-25 22:51:19,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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 22:51:19,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 22:51:19,460 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 22:51:19,460 INFO L185 Difference]: Start difference. First operand has 156 places, 198 transitions, 2071 flow. Second operand 7 states and 1671 transitions. [2021-03-25 22:51:19,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 259 transitions, 3092 flow [2021-03-25 22:51:19,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 259 transitions, 3028 flow, removed 32 selfloop flow, removed 0 redundant places. [2021-03-25 22:51:19,499 INFO L241 Difference]: Finished difference. Result has 165 places, 203 transitions, 2219 flow [2021-03-25 22:51:19,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2023, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2219, PETRI_PLACES=165, PETRI_TRANSITIONS=203} [2021-03-25 22:51:19,499 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 87 predicate places. [2021-03-25 22:51:19,499 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:19,499 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 203 transitions, 2219 flow [2021-03-25 22:51:19,499 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 203 transitions, 2219 flow [2021-03-25 22:51:19,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 203 transitions, 2219 flow [2021-03-25 22:51:19,585 INFO L129 PetriNetUnfolder]: 393/1268 cut-off events. [2021-03-25 22:51:19,585 INFO L130 PetriNetUnfolder]: For 8974/9027 co-relation queries the response was YES. [2021-03-25 22:51:19,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6005 conditions, 1268 events. 393/1268 cut-off events. For 8974/9027 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10286 event pairs, 2 based on Foata normal form. 21/1177 useless extension candidates. Maximal degree in co-relation 5787. Up to 200 conditions per place. [2021-03-25 22:51:19,600 INFO L142 LiptonReduction]: Number of co-enabled transitions 2562 [2021-03-25 22:51:19,675 INFO L154 LiptonReduction]: Checked pairs total: 2222 [2021-03-25 22:51:19,675 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:19,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 176 [2021-03-25 22:51:19,676 INFO L480 AbstractCegarLoop]: Abstraction has has 163 places, 203 transitions, 2219 flow [2021-03-25 22:51:19,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.71428571428572) internal successors, (1587), 7 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states 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 22:51:19,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:19,676 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 22:51:19,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 22:51:19,677 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 22:51:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:19,677 INFO L82 PathProgramCache]: Analyzing trace with hash -813439433, now seen corresponding path program 1 times [2021-03-25 22:51:19,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:19,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260823908] [2021-03-25 22:51:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:19,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:19,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,707 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-03-25 22:51:19,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:19,707 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 22:51:19,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260823908] [2021-03-25 22:51:19,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:19,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 22:51:19,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041761453] [2021-03-25 22:51:19,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 22:51:19,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 22:51:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 22:51:19,709 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 321 [2021-03-25 22:51:19,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 203 transitions, 2219 flow. Second operand has 5 states, 5 states have (on average 260.2) internal successors, (1301), 5 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states 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 22:51:19,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:19,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 321 [2021-03-25 22:51:19,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:19,947 INFO L129 PetriNetUnfolder]: 429/1411 cut-off events. [2021-03-25 22:51:19,948 INFO L130 PetriNetUnfolder]: For 11803/11945 co-relation queries the response was YES. [2021-03-25 22:51:19,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 1411 events. 429/1411 cut-off events. For 11803/11945 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11690 event pairs, 1 based on Foata normal form. 85/1379 useless extension candidates. Maximal degree in co-relation 6842. Up to 270 conditions per place. [2021-03-25 22:51:19,962 INFO L132 encePairwiseOnDemand]: 308/321 looper letters, 34 selfloop transitions, 38 changer transitions 16/215 dead transitions. [2021-03-25 22:51:19,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 215 transitions, 2568 flow [2021-03-25 22:51:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 22:51:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 22:51:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1332 transitions. [2021-03-25 22:51:19,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8299065420560747 [2021-03-25 22:51:19,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1332 transitions. [2021-03-25 22:51:19,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1332 transitions. [2021-03-25 22:51:19,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:19,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1332 transitions. [2021-03-25 22:51:19,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 266.4) internal successors, (1332), 5 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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 22:51:19,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 22:51:19,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 22:51:19,968 INFO L185 Difference]: Start difference. First operand has 163 places, 203 transitions, 2219 flow. Second operand 5 states and 1332 transitions. [2021-03-25 22:51:19,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 215 transitions, 2568 flow [2021-03-25 22:51:20,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 215 transitions, 2486 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-25 22:51:20,028 INFO L241 Difference]: Finished difference. Result has 167 places, 198 transitions, 2203 flow [2021-03-25 22:51:20,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2203, PETRI_PLACES=167, PETRI_TRANSITIONS=198} [2021-03-25 22:51:20,028 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 89 predicate places. [2021-03-25 22:51:20,028 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:20,028 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 198 transitions, 2203 flow [2021-03-25 22:51:20,029 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 198 transitions, 2203 flow [2021-03-25 22:51:20,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 198 transitions, 2203 flow [2021-03-25 22:51:20,143 INFO L129 PetriNetUnfolder]: 328/1167 cut-off events. [2021-03-25 22:51:20,143 INFO L130 PetriNetUnfolder]: For 9296/9342 co-relation queries the response was YES. [2021-03-25 22:51:20,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5443 conditions, 1167 events. 328/1167 cut-off events. For 9296/9342 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9560 event pairs, 1 based on Foata normal form. 23/1097 useless extension candidates. Maximal degree in co-relation 5296. Up to 172 conditions per place. [2021-03-25 22:51:20,165 INFO L142 LiptonReduction]: Number of co-enabled transitions 2498 [2021-03-25 22:51:20,248 INFO L154 LiptonReduction]: Checked pairs total: 2280 [2021-03-25 22:51:20,248 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:20,248 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 220 [2021-03-25 22:51:20,250 INFO L480 AbstractCegarLoop]: Abstraction has has 167 places, 198 transitions, 2203 flow [2021-03-25 22:51:20,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 260.2) internal successors, (1301), 5 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states 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 22:51:20,250 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:20,250 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 22:51:20,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 22:51:20,251 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 22:51:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash -476044168, now seen corresponding path program 1 times [2021-03-25 22:51:20,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:20,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657112354] [2021-03-25 22:51:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:20,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:20,306 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 22:51:20,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657112354] [2021-03-25 22:51:20,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:20,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:51:20,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72036706] [2021-03-25 22:51:20,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:51:20,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:51:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:51:20,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 321 [2021-03-25 22:51:20,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 198 transitions, 2203 flow. Second operand has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:20,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:20,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 321 [2021-03-25 22:51:20,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:20,619 INFO L129 PetriNetUnfolder]: 617/1598 cut-off events. [2021-03-25 22:51:20,619 INFO L130 PetriNetUnfolder]: For 14887/14987 co-relation queries the response was YES. [2021-03-25 22:51:20,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8356 conditions, 1598 events. 617/1598 cut-off events. For 14887/14987 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11821 event pairs, 29 based on Foata normal form. 34/1368 useless extension candidates. Maximal degree in co-relation 8176. Up to 383 conditions per place. [2021-03-25 22:51:20,629 INFO L132 encePairwiseOnDemand]: 306/321 looper letters, 100 selfloop transitions, 22 changer transitions 58/251 dead transitions. [2021-03-25 22:51:20,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 251 transitions, 3118 flow [2021-03-25 22:51:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:51:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:51:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1434 transitions. [2021-03-25 22:51:20,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7445482866043613 [2021-03-25 22:51:20,631 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1434 transitions. [2021-03-25 22:51:20,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1434 transitions. [2021-03-25 22:51:20,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:20,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1434 transitions. [2021-03-25 22:51:20,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states 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 22:51:20,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:20,634 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:20,634 INFO L185 Difference]: Start difference. First operand has 167 places, 198 transitions, 2203 flow. Second operand 6 states and 1434 transitions. [2021-03-25 22:51:20,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 251 transitions, 3118 flow [2021-03-25 22:51:20,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 251 transitions, 3007 flow, removed 38 selfloop flow, removed 3 redundant places. [2021-03-25 22:51:20,679 INFO L241 Difference]: Finished difference. Result has 172 places, 177 transitions, 1891 flow [2021-03-25 22:51:20,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1891, PETRI_PLACES=172, PETRI_TRANSITIONS=177} [2021-03-25 22:51:20,679 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2021-03-25 22:51:20,679 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:20,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 177 transitions, 1891 flow [2021-03-25 22:51:20,679 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 177 transitions, 1891 flow [2021-03-25 22:51:20,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 177 transitions, 1891 flow [2021-03-25 22:51:20,747 INFO L129 PetriNetUnfolder]: 265/978 cut-off events. [2021-03-25 22:51:20,747 INFO L130 PetriNetUnfolder]: For 7888/7904 co-relation queries the response was YES. [2021-03-25 22:51:20,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 978 events. 265/978 cut-off events. For 7888/7904 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7701 event pairs, 2 based on Foata normal form. 7/900 useless extension candidates. Maximal degree in co-relation 4566. Up to 154 conditions per place. [2021-03-25 22:51:20,758 INFO L142 LiptonReduction]: Number of co-enabled transitions 2244 [2021-03-25 22:51:20,786 INFO L154 LiptonReduction]: Checked pairs total: 1263 [2021-03-25 22:51:20,786 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:20,787 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-25 22:51:20,788 INFO L480 AbstractCegarLoop]: Abstraction has has 167 places, 177 transitions, 1891 flow [2021-03-25 22:51:20,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:20,788 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:20,788 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 22:51:20,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 22:51:20,788 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 22:51:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -446279263, now seen corresponding path program 1 times [2021-03-25 22:51:20,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:20,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200336790] [2021-03-25 22:51:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:20,810 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:20,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:20,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:20,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:20,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:20,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:20,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:20,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:20,856 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 22:51:20,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200336790] [2021-03-25 22:51:20,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:20,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:51:20,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136971571] [2021-03-25 22:51:20,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:51:20,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:51:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:51:20,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 321 [2021-03-25 22:51:20,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 177 transitions, 1891 flow. Second operand has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:20,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:20,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 321 [2021-03-25 22:51:20,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:21,638 INFO L129 PetriNetUnfolder]: 798/1873 cut-off events. [2021-03-25 22:51:21,638 INFO L130 PetriNetUnfolder]: For 17073/17210 co-relation queries the response was YES. [2021-03-25 22:51:21,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10212 conditions, 1873 events. 798/1873 cut-off events. For 17073/17210 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12956 event pairs, 34 based on Foata normal form. 47/1603 useless extension candidates. Maximal degree in co-relation 9982. Up to 281 conditions per place. [2021-03-25 22:51:21,653 INFO L132 encePairwiseOnDemand]: 296/321 looper letters, 111 selfloop transitions, 79 changer transitions 168/381 dead transitions. [2021-03-25 22:51:21,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 381 transitions, 4440 flow [2021-03-25 22:51:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-25 22:51:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-03-25 22:51:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5547 transitions. [2021-03-25 22:51:21,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5958749597164035 [2021-03-25 22:51:21,657 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5547 transitions. [2021-03-25 22:51:21,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5547 transitions. [2021-03-25 22:51:21,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:21,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5547 transitions. [2021-03-25 22:51:21,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 191.27586206896552) internal successors, (5547), 29 states have internal predecessors, (5547), 0 states have call successors, (0), 0 states 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 22:51:21,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 321.0) internal successors, (9630), 30 states have internal predecessors, (9630), 0 states have call successors, (0), 0 states 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 22:51:21,669 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 321.0) internal successors, (9630), 30 states have internal predecessors, (9630), 0 states have call successors, (0), 0 states 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 22:51:21,669 INFO L185 Difference]: Start difference. First operand has 167 places, 177 transitions, 1891 flow. Second operand 29 states and 5547 transitions. [2021-03-25 22:51:21,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 381 transitions, 4440 flow [2021-03-25 22:51:21,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 381 transitions, 4206 flow, removed 79 selfloop flow, removed 7 redundant places. [2021-03-25 22:51:21,735 INFO L241 Difference]: Finished difference. Result has 199 places, 159 transitions, 1804 flow [2021-03-25 22:51:21,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1804, PETRI_PLACES=199, PETRI_TRANSITIONS=159} [2021-03-25 22:51:21,735 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 121 predicate places. [2021-03-25 22:51:21,735 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:21,735 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 159 transitions, 1804 flow [2021-03-25 22:51:21,735 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 159 transitions, 1804 flow [2021-03-25 22:51:21,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 187 places, 159 transitions, 1804 flow [2021-03-25 22:51:21,787 INFO L129 PetriNetUnfolder]: 190/688 cut-off events. [2021-03-25 22:51:21,788 INFO L130 PetriNetUnfolder]: For 5780/5796 co-relation queries the response was YES. [2021-03-25 22:51:21,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 688 events. 190/688 cut-off events. For 5780/5796 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4737 event pairs, 1 based on Foata normal form. 6/646 useless extension candidates. Maximal degree in co-relation 3275. Up to 95 conditions per place. [2021-03-25 22:51:21,796 INFO L142 LiptonReduction]: Number of co-enabled transitions 1706 [2021-03-25 22:51:21,915 INFO L154 LiptonReduction]: Checked pairs total: 1893 [2021-03-25 22:51:21,916 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 22:51:21,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 181 [2021-03-25 22:51:21,917 INFO L480 AbstractCegarLoop]: Abstraction has has 186 places, 158 transitions, 1798 flow [2021-03-25 22:51:21,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:21,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:21,917 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 22:51:21,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 22:51:21,917 INFO L428 AbstractCegarLoop]: === Iteration 26 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 22:51:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash 402195606, now seen corresponding path program 1 times [2021-03-25 22:51:21,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:21,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891201215] [2021-03-25 22:51:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:21,939 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:21,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:21,943 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:21,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:21,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:21,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:21,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:21,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:21,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:21,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:21,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:21,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:21,984 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 22:51:21,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891201215] [2021-03-25 22:51:21,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:21,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:51:21,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300124152] [2021-03-25 22:51:21,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:51:21,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:51:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:51:21,987 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 326 [2021-03-25 22:51:21,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 158 transitions, 1798 flow. Second operand has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:21,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:21,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 326 [2021-03-25 22:51:21,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:22,570 INFO L129 PetriNetUnfolder]: 486/1216 cut-off events. [2021-03-25 22:51:22,570 INFO L130 PetriNetUnfolder]: For 11498/11585 co-relation queries the response was YES. [2021-03-25 22:51:22,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7010 conditions, 1216 events. 486/1216 cut-off events. For 11498/11585 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7816 event pairs, 40 based on Foata normal form. 37/1082 useless extension candidates. Maximal degree in co-relation 6765. Up to 149 conditions per place. [2021-03-25 22:51:22,583 INFO L132 encePairwiseOnDemand]: 302/326 looper letters, 104 selfloop transitions, 80 changer transitions 52/259 dead transitions. [2021-03-25 22:51:22,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 259 transitions, 3278 flow [2021-03-25 22:51:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-25 22:51:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-03-25 22:51:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4191 transitions. [2021-03-25 22:51:22,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5843558282208589 [2021-03-25 22:51:22,589 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4191 transitions. [2021-03-25 22:51:22,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4191 transitions. [2021-03-25 22:51:22,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:22,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4191 transitions. [2021-03-25 22:51:22,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 190.5) internal successors, (4191), 22 states have internal predecessors, (4191), 0 states have call successors, (0), 0 states 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 22:51:22,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 326.0) internal successors, (7498), 23 states have internal predecessors, (7498), 0 states have call successors, (0), 0 states 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 22:51:22,599 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 326.0) internal successors, (7498), 23 states have internal predecessors, (7498), 0 states have call successors, (0), 0 states 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 22:51:22,599 INFO L185 Difference]: Start difference. First operand has 186 places, 158 transitions, 1798 flow. Second operand 22 states and 4191 transitions. [2021-03-25 22:51:22,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 259 transitions, 3278 flow [2021-03-25 22:51:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 259 transitions, 2872 flow, removed 102 selfloop flow, removed 25 redundant places. [2021-03-25 22:51:22,663 INFO L241 Difference]: Finished difference. Result has 187 places, 157 transitions, 1685 flow [2021-03-25 22:51:22,664 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1685, PETRI_PLACES=187, PETRI_TRANSITIONS=157} [2021-03-25 22:51:22,664 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 109 predicate places. [2021-03-25 22:51:22,664 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:22,664 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 157 transitions, 1685 flow [2021-03-25 22:51:22,664 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 157 transitions, 1685 flow [2021-03-25 22:51:22,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 177 places, 157 transitions, 1685 flow [2021-03-25 22:51:22,744 INFO L129 PetriNetUnfolder]: 188/668 cut-off events. [2021-03-25 22:51:22,744 INFO L130 PetriNetUnfolder]: For 4405/4424 co-relation queries the response was YES. [2021-03-25 22:51:22,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 668 events. 188/668 cut-off events. For 4405/4424 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4525 event pairs, 1 based on Foata normal form. 4/625 useless extension candidates. Maximal degree in co-relation 3192. Up to 80 conditions per place. [2021-03-25 22:51:22,758 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-25 22:51:22,875 INFO L154 LiptonReduction]: Checked pairs total: 1754 [2021-03-25 22:51:22,875 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 22:51:22,875 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 211 [2021-03-25 22:51:22,876 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 156 transitions, 1689 flow [2021-03-25 22:51:22,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 184.72727272727272) internal successors, (2032), 11 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 22:51:22,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:22,877 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 22:51:22,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 22:51:22,877 INFO L428 AbstractCegarLoop]: === Iteration 27 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 22:51:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 273017340, now seen corresponding path program 1 times [2021-03-25 22:51:22,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:22,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284021799] [2021-03-25 22:51:22,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:22,900 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:22,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:22,905 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-25 22:51:22,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:22,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:22,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:22,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:22,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 22:51:22,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:22,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:22,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:22,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:22,953 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 22:51:22,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284021799] [2021-03-25 22:51:22,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:22,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 22:51:22,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368410692] [2021-03-25 22:51:22,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 22:51:22,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:22,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 22:51:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-25 22:51:22,956 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 329 [2021-03-25 22:51:22,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 156 transitions, 1689 flow. Second operand has 11 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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 22:51:22,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:22,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 329 [2021-03-25 22:51:22,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:23,428 INFO L129 PetriNetUnfolder]: 424/1091 cut-off events. [2021-03-25 22:51:23,429 INFO L130 PetriNetUnfolder]: For 7151/7235 co-relation queries the response was YES. [2021-03-25 22:51:23,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6078 conditions, 1091 events. 424/1091 cut-off events. For 7151/7235 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6792 event pairs, 38 based on Foata normal form. 49/993 useless extension candidates. Maximal degree in co-relation 5924. Up to 138 conditions per place. [2021-03-25 22:51:23,434 INFO L132 encePairwiseOnDemand]: 298/329 looper letters, 52 selfloop transitions, 44 changer transitions 108/224 dead transitions. [2021-03-25 22:51:23,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 224 transitions, 2789 flow [2021-03-25 22:51:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-25 22:51:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-03-25 22:51:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3986 transitions. [2021-03-25 22:51:23,438 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5769286437979447 [2021-03-25 22:51:23,438 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3986 transitions. [2021-03-25 22:51:23,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3986 transitions. [2021-03-25 22:51:23,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:23,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3986 transitions. [2021-03-25 22:51:23,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 189.8095238095238) internal successors, (3986), 21 states have internal predecessors, (3986), 0 states have call successors, (0), 0 states 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 22:51:23,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 329.0) internal successors, (7238), 22 states have internal predecessors, (7238), 0 states have call successors, (0), 0 states 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 22:51:23,447 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 329.0) internal successors, (7238), 22 states have internal predecessors, (7238), 0 states have call successors, (0), 0 states 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 22:51:23,447 INFO L185 Difference]: Start difference. First operand has 175 places, 156 transitions, 1689 flow. Second operand 21 states and 3986 transitions. [2021-03-25 22:51:23,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 224 transitions, 2789 flow [2021-03-25 22:51:23,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 224 transitions, 2491 flow, removed 55 selfloop flow, removed 21 redundant places. [2021-03-25 22:51:23,482 INFO L241 Difference]: Finished difference. Result has 176 places, 93 transitions, 900 flow [2021-03-25 22:51:23,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=900, PETRI_PLACES=176, PETRI_TRANSITIONS=93} [2021-03-25 22:51:23,483 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 98 predicate places. [2021-03-25 22:51:23,483 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:23,483 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 93 transitions, 900 flow [2021-03-25 22:51:23,483 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 93 transitions, 900 flow [2021-03-25 22:51:23,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 93 transitions, 900 flow [2021-03-25 22:51:23,511 INFO L129 PetriNetUnfolder]: 105/401 cut-off events. [2021-03-25 22:51:23,512 INFO L130 PetriNetUnfolder]: For 2249/2271 co-relation queries the response was YES. [2021-03-25 22:51:23,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 401 events. 105/401 cut-off events. For 2249/2271 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2314 event pairs, 1 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 1883. Up to 65 conditions per place. [2021-03-25 22:51:23,515 INFO L142 LiptonReduction]: Number of co-enabled transitions 810 [2021-03-25 22:51:24,706 INFO L154 LiptonReduction]: Checked pairs total: 1092 [2021-03-25 22:51:24,706 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 22:51:24,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1223 [2021-03-25 22:51:24,707 INFO L480 AbstractCegarLoop]: Abstraction has has 140 places, 87 transitions, 950 flow [2021-03-25 22:51:24,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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 22:51:24,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:24,707 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 22:51:24,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 22:51:24,707 INFO L428 AbstractCegarLoop]: === Iteration 28 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 22:51:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1567658930, now seen corresponding path program 1 times [2021-03-25 22:51:24,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:24,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762316887] [2021-03-25 22:51:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:24,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:24,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:24,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:24,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:24,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:24,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:24,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:24,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:24,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:24,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:24,756 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 22:51:24,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762316887] [2021-03-25 22:51:24,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:24,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 22:51:24,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140602430] [2021-03-25 22:51:24,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 22:51:24,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:24,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 22:51:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 22:51:24,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 341 [2021-03-25 22:51:24,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 87 transitions, 950 flow. Second operand has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 22:51:24,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:24,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 341 [2021-03-25 22:51:24,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:24,897 INFO L129 PetriNetUnfolder]: 207/498 cut-off events. [2021-03-25 22:51:24,897 INFO L130 PetriNetUnfolder]: For 3529/3556 co-relation queries the response was YES. [2021-03-25 22:51:24,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 498 events. 207/498 cut-off events. For 3529/3556 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2442 event pairs, 13 based on Foata normal form. 7/447 useless extension candidates. Maximal degree in co-relation 2773. Up to 88 conditions per place. [2021-03-25 22:51:24,900 INFO L132 encePairwiseOnDemand]: 327/341 looper letters, 35 selfloop transitions, 18 changer transitions 42/122 dead transitions. [2021-03-25 22:51:24,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 122 transitions, 1533 flow [2021-03-25 22:51:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 22:51:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 22:51:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2079 transitions. [2021-03-25 22:51:24,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2021-03-25 22:51:24,902 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2079 transitions. [2021-03-25 22:51:24,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2079 transitions. [2021-03-25 22:51:24,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:24,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2079 transitions. [2021-03-25 22:51:24,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states 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 22:51:24,906 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 22:51:24,906 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 22:51:24,906 INFO L185 Difference]: Start difference. First operand has 140 places, 87 transitions, 950 flow. Second operand 9 states and 2079 transitions. [2021-03-25 22:51:24,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 122 transitions, 1533 flow [2021-03-25 22:51:24,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 122 transitions, 1205 flow, removed 40 selfloop flow, removed 40 redundant places. [2021-03-25 22:51:24,918 INFO L241 Difference]: Finished difference. Result has 109 places, 69 transitions, 579 flow [2021-03-25 22:51:24,918 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=579, PETRI_PLACES=109, PETRI_TRANSITIONS=69} [2021-03-25 22:51:24,918 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 31 predicate places. [2021-03-25 22:51:24,919 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:24,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 69 transitions, 579 flow [2021-03-25 22:51:24,919 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 69 transitions, 579 flow [2021-03-25 22:51:24,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 69 transitions, 579 flow [2021-03-25 22:51:24,933 INFO L129 PetriNetUnfolder]: 48/165 cut-off events. [2021-03-25 22:51:24,933 INFO L130 PetriNetUnfolder]: For 661/665 co-relation queries the response was YES. [2021-03-25 22:51:24,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 165 events. 48/165 cut-off events. For 661/665 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 611 event pairs, 1 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 653. Up to 23 conditions per place. [2021-03-25 22:51:24,935 INFO L142 LiptonReduction]: Number of co-enabled transitions 442 [2021-03-25 22:51:25,386 INFO L154 LiptonReduction]: Checked pairs total: 273 [2021-03-25 22:51:25,386 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 22:51:25,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 467 [2021-03-25 22:51:25,386 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 68 transitions, 586 flow [2021-03-25 22:51:25,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 22:51:25,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 22:51:25,387 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] [2021-03-25 22:51:25,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 22:51:25,387 INFO L428 AbstractCegarLoop]: === Iteration 29 === [qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-03-25 22:51:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 22:51:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2077856429, now seen corresponding path program 1 times [2021-03-25 22:51:25,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 22:51:25,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619425083] [2021-03-25 22:51:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 22:51:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 22:51:25,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:25,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:25,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:25,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:25,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:25,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 22:51:25,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 22:51:25,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 22:51:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 22:51:25,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619425083] [2021-03-25 22:51:25,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 22:51:25,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 22:51:25,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638325770] [2021-03-25 22:51:25,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 22:51:25,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 22:51:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 22:51:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 22:51:25,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 347 [2021-03-25 22:51:25,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 68 transitions, 586 flow. Second operand has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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 22:51:25,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 22:51:25,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 347 [2021-03-25 22:51:25,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 22:51:25,520 INFO L129 PetriNetUnfolder]: 64/175 cut-off events. [2021-03-25 22:51:25,521 INFO L130 PetriNetUnfolder]: For 949/962 co-relation queries the response was YES. [2021-03-25 22:51:25,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 175 events. 64/175 cut-off events. For 949/962 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 594 event pairs, 2 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 864. Up to 53 conditions per place. [2021-03-25 22:51:25,522 INFO L132 encePairwiseOnDemand]: 337/347 looper letters, 0 selfloop transitions, 0 changer transitions 78/78 dead transitions. [2021-03-25 22:51:25,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 78 transitions, 784 flow [2021-03-25 22:51:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 22:51:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 22:51:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2021-03-25 22:51:25,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6685878962536023 [2021-03-25 22:51:25,524 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1392 transitions. [2021-03-25 22:51:25,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1392 transitions. [2021-03-25 22:51:25,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 22:51:25,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1392 transitions. [2021-03-25 22:51:25,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 22:51:25,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states 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 22:51:25,527 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states 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 22:51:25,527 INFO L185 Difference]: Start difference. First operand has 104 places, 68 transitions, 586 flow. Second operand 6 states and 1392 transitions. [2021-03-25 22:51:25,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 78 transitions, 784 flow [2021-03-25 22:51:25,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 78 transitions, 673 flow, removed 19 selfloop flow, removed 15 redundant places. [2021-03-25 22:51:25,531 INFO L241 Difference]: Finished difference. Result has 93 places, 0 transitions, 0 flow [2021-03-25 22:51:25,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=93, PETRI_TRANSITIONS=0} [2021-03-25 22:51:25,532 INFO L343 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2021-03-25 22:51:25,532 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 22:51:25,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 0 transitions, 0 flow [2021-03-25 22:51:25,532 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 0 transitions, 0 flow [2021-03-25 22:51:25,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 22:51:25,532 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 22:51:25,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 22:51:25,532 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 22:51:25,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 22:51:25,533 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 22:51:25,533 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 22:51:25,533 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 22:51:25,534 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 22:51:25,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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 22:51:25,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 22:51:25,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 10:51:25 BasicIcfg [2021-03-25 22:51:25,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 22:51:25,539 INFO L168 Benchmark]: Toolchain (without parser) took 47149.83 ms. Allocated memory was 255.9 MB in the beginning and 5.2 GB in the end (delta: 4.9 GB). Free memory was 234.1 MB in the beginning and 3.8 GB in the end (delta: -3.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.17 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 234.1 MB in the beginning and 324.8 MB in the end (delta: -90.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.18 ms. Allocated memory is still 364.9 MB. Free memory was 324.8 MB in the beginning and 322.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: Boogie Preprocessor took 26.69 ms. Allocated memory is still 364.9 MB. Free memory was 322.1 MB in the beginning and 320.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: RCFGBuilder took 924.28 ms. Allocated memory is still 364.9 MB. Free memory was 320.0 MB in the beginning and 279.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,539 INFO L168 Benchmark]: TraceAbstraction took 45665.88 ms. Allocated memory was 364.9 MB in the beginning and 5.2 GB in the end (delta: 4.8 GB). Free memory was 279.3 MB in the beginning and 3.8 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-03-25 22:51:25,547 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 478.17 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 234.1 MB in the beginning and 324.8 MB in the end (delta: -90.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.18 ms. Allocated memory is still 364.9 MB. Free memory was 324.8 MB in the beginning and 322.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.69 ms. Allocated memory is still 364.9 MB. Free memory was 322.1 MB in the beginning and 320.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 924.28 ms. Allocated memory is still 364.9 MB. Free memory was 320.0 MB in the beginning and 279.3 MB in the end (delta: 40.6 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 45665.88 ms. Allocated memory was 364.9 MB in the beginning and 5.2 GB in the end (delta: 4.8 GB). Free memory was 279.3 MB in the beginning and 3.8 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4412.8ms, 147 PlacesBefore, 78 PlacesAfterwards, 159 TransitionsBefore, 86 TransitionsAfterwards, 10120 CoEnabledTransitionPairs, 6 FixpointIterations, 20 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 85 TotalNumberOfCompositions, 12308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6289, positive: 6127, positive conditional: 6127, positive unconditional: 0, negative: 162, negative conditional: 162, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4717, positive: 4633, positive conditional: 0, positive unconditional: 4633, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4717, positive: 4633, positive conditional: 0, positive unconditional: 4633, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4717, positive: 4622, positive conditional: 0, positive unconditional: 4622, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 540, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 486, negative conditional: 0, negative unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6289, positive: 1494, positive conditional: 1494, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 4717, unknown conditional: 4717, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 551, Positive conditional cache size: 551, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1523.1ms, 82 PlacesBefore, 73 PlacesAfterwards, 104 TransitionsBefore, 95 TransitionsAfterwards, 4322 CoEnabledTransitionPairs, 5 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, 8618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2060, positive: 1889, positive conditional: 1889, positive unconditional: 0, negative: 171, negative conditional: 171, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 928, positive: 895, positive conditional: 166, positive unconditional: 729, negative: 33, negative conditional: 4, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 928, positive: 895, positive conditional: 166, positive unconditional: 729, negative: 33, negative conditional: 4, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 928, positive: 887, positive conditional: 0, positive unconditional: 887, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 33, negative conditional: 4, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 175, negative conditional: 25, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2060, positive: 994, positive conditional: 994, positive unconditional: 0, negative: 138, negative conditional: 138, negative unconditional: 0, unknown: 928, unknown conditional: 928, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 884, Positive conditional cache size: 884, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1858.4ms, 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: 1576, positive: 1484, positive conditional: 1484, positive unconditional: 0, negative: 92, negative conditional: 92, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 416, positive: 397, positive conditional: 80, positive unconditional: 317, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, positive: 397, positive conditional: 80, positive unconditional: 317, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, positive: 397, positive conditional: 0, positive unconditional: 397, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 95, negative conditional: 19, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1576, positive: 1087, positive conditional: 1087, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 416, unknown conditional: 416, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 593, Positive conditional cache size: 593, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 272.2ms, 71 PlacesBefore, 71 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 3086 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 5178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 928, positive: 810, positive conditional: 810, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, positive: 324, positive conditional: 74, positive unconditional: 250, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 340, positive: 324, positive conditional: 74, positive unconditional: 250, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 340, positive: 323, positive conditional: 0, positive unconditional: 323, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 57, negative conditional: 11, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 928, positive: 486, positive conditional: 486, positive unconditional: 0, negative: 102, negative conditional: 102, negative unconditional: 0, unknown: 340, unknown conditional: 340, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 498, Positive conditional cache size: 498, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.6ms, 79 PlacesBefore, 79 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 254, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, positive: 58, positive conditional: 22, positive unconditional: 36, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 65, positive: 58, positive conditional: 22, positive unconditional: 36, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 65, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 65, unknown conditional: 65, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 621, Positive cache size: 556, Positive conditional cache size: 556, Positive unconditional cache size: 0, Negative cache size: 65, Negative conditional cache size: 65, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.6ms, 83 PlacesBefore, 83 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1746 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 284, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 284, positive: 240, positive conditional: 240, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 567, Positive conditional cache size: 567, Positive unconditional cache size: 0, Negative cache size: 65, Negative conditional cache size: 65, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 279.2ms, 93 PlacesBefore, 93 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 4708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 9, positive unconditional: 11, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 9, positive unconditional: 11, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 587, Positive conditional cache size: 587, Positive unconditional cache size: 0, Negative cache size: 71, Negative conditional cache size: 71, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 295.9ms, 100 PlacesBefore, 100 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 4992 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1561 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 111, positive conditional: 111, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 615, Positive conditional cache size: 615, Positive unconditional cache size: 0, Negative cache size: 72, Negative conditional cache size: 72, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 871.7ms, 106 PlacesBefore, 106 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 963 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 15, negative conditional: 15, 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: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 615, Positive conditional cache size: 615, Positive unconditional cache size: 0, Negative cache size: 72, Negative conditional cache size: 72, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 795.5ms, 109 PlacesBefore, 109 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 960 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 22, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 36, positive conditional: 22, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 725, Positive cache size: 651, Positive conditional cache size: 651, Positive unconditional cache size: 0, Negative cache size: 74, Negative conditional cache size: 74, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 638.7ms, 111 PlacesBefore, 111 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 5334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 865 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 52, positive conditional: 33, positive unconditional: 19, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, positive: 52, positive conditional: 33, positive unconditional: 19, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 55, unknown conditional: 55, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 703, Positive conditional cache size: 703, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2397.8ms, 121 PlacesBefore, 121 PlacesAfterwards, 184 TransitionsBefore, 184 TransitionsAfterwards, 6146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 303, positive: 282, positive conditional: 282, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, positive: 101, positive conditional: 51, positive unconditional: 50, negative: 13, negative conditional: 6, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 114, positive: 101, positive conditional: 51, positive unconditional: 50, negative: 13, negative conditional: 6, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 114, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 6, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 105, negative conditional: 42, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 114, unknown conditional: 114, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 804, Positive conditional cache size: 804, Positive unconditional cache size: 0, Negative cache size: 90, Negative conditional cache size: 90, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 562.5ms, 134 PlacesBefore, 119 PlacesAfterwards, 119 TransitionsBefore, 117 TransitionsAfterwards, 3704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1702 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, positive: 300, positive conditional: 300, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, positive: 136, positive conditional: 88, positive unconditional: 48, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 141, positive: 136, positive conditional: 88, positive unconditional: 48, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 141, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, positive: 164, positive conditional: 164, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 141, unknown conditional: 141, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 517, Positive conditional cache size: 517, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 453.1ms, 105 PlacesBefore, 105 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 3426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 802 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 529, Positive conditional cache size: 529, Positive unconditional cache size: 0, Negative cache size: 86, Negative conditional cache size: 86, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 494.8ms, 123 PlacesBefore, 122 PlacesAfterwards, 166 TransitionsBefore, 165 TransitionsAfterwards, 3692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 552, positive: 524, positive conditional: 524, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, positive: 151, positive conditional: 85, positive unconditional: 66, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 155, positive: 151, positive conditional: 85, positive unconditional: 66, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 155, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 45, negative conditional: 13, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 552, positive: 373, positive conditional: 373, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 155, unknown conditional: 155, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 536, Positive conditional cache size: 536, Positive unconditional cache size: 0, Negative cache size: 86, Negative conditional cache size: 86, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 216.8ms, 118 PlacesBefore, 118 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 272, positive: 254, positive conditional: 254, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, positive: 236, positive conditional: 236, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 549, Positive conditional cache size: 549, Positive unconditional cache size: 0, Negative cache size: 87, Negative conditional cache size: 87, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 235.5ms, 128 PlacesBefore, 128 PlacesAfterwards, 166 TransitionsBefore, 166 TransitionsAfterwards, 3098 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 554, Positive conditional cache size: 554, Positive unconditional cache size: 0, Negative cache size: 89, Negative conditional cache size: 89, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 502.1ms, 149 PlacesBefore, 149 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 3100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 236, positive: 218, positive conditional: 218, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 89, positive conditional: 55, positive unconditional: 34, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, positive: 89, positive conditional: 55, positive unconditional: 34, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 63, negative conditional: 63, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 236, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 93, unknown conditional: 93, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 713, Positive cache size: 624, Positive conditional cache size: 624, Positive unconditional cache size: 0, Negative cache size: 89, Negative conditional cache size: 89, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 634.9ms, 154 PlacesBefore, 153 PlacesAfterwards, 181 TransitionsBefore, 180 TransitionsAfterwards, 3084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1694 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 371, positive: 347, positive conditional: 347, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 105, positive conditional: 78, positive unconditional: 27, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 108, positive: 105, positive conditional: 78, positive unconditional: 27, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 108, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 108, unknown conditional: 108, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 755, Positive cache size: 664, Positive conditional cache size: 664, Positive unconditional cache size: 0, Negative cache size: 91, Negative conditional cache size: 91, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 321.5ms, 162 PlacesBefore, 162 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 3176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 205, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 30, positive conditional: 21, positive unconditional: 9, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 30, positive conditional: 21, positive unconditional: 9, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 205, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 694, Positive conditional cache size: 694, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 815.1ms, 178 PlacesBefore, 169 PlacesAfterwards, 183 TransitionsBefore, 180 TransitionsAfterwards, 2454 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 447, positive: 411, positive conditional: 411, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 110, positive conditional: 71, positive unconditional: 39, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 111, positive: 110, positive conditional: 71, positive unconditional: 39, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 111, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, positive: 301, positive conditional: 301, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 111, unknown conditional: 111, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 664, Positive conditional cache size: 664, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 349.2ms, 157 PlacesBefore, 156 PlacesAfterwards, 199 TransitionsBefore, 198 TransitionsAfterwards, 2618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 763, positive: 725, positive conditional: 725, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 71, positive conditional: 50, positive unconditional: 21, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 71, positive conditional: 50, positive unconditional: 21, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 12, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, positive: 654, positive conditional: 654, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 637, Positive conditional cache size: 637, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 175.6ms, 165 PlacesBefore, 163 PlacesAfterwards, 203 TransitionsBefore, 203 TransitionsAfterwards, 2562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 422, positive conditional: 422, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 409, positive conditional: 409, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 650, Positive conditional cache size: 650, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.6ms, 167 PlacesBefore, 167 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 654, Positive conditional cache size: 654, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.3ms, 172 PlacesBefore, 167 PlacesAfterwards, 177 TransitionsBefore, 177 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 656, Positive conditional cache size: 656, Positive unconditional cache size: 0, Negative cache size: 95, Negative conditional cache size: 95, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 180.4ms, 199 PlacesBefore, 186 PlacesAfterwards, 159 TransitionsBefore, 158 TransitionsAfterwards, 1706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1893 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 26, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 26, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 616, Positive conditional cache size: 616, Positive unconditional cache size: 0, Negative cache size: 95, Negative conditional cache size: 95, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 211.1ms, 187 PlacesBefore, 175 PlacesAfterwards, 157 TransitionsBefore, 156 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1754 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, positive: 98, positive conditional: 98, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 24, positive unconditional: 7, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 24, positive unconditional: 7, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 586, Positive conditional cache size: 586, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1222.7ms, 176 PlacesBefore, 140 PlacesAfterwards, 93 TransitionsBefore, 87 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 519, positive: 486, positive conditional: 486, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 102, positive conditional: 72, positive unconditional: 30, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 108, positive: 102, positive conditional: 72, positive unconditional: 30, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 108, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 519, positive: 384, positive conditional: 384, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 108, unknown conditional: 108, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 569, Positive conditional cache size: 569, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 466.9ms, 109 PlacesBefore, 104 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 273 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 19, positive unconditional: 15, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 19, positive unconditional: 15, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 547, Positive conditional cache size: 547, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6ms, 93 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: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 547, Positive conditional cache size: 547, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 45478.4ms, OverallIterations: 29, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 22617.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4527.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 708 SDtfs, 1550 SDslu, 1294 SDs, 0 SdLazy, 5545 SolverSat, 621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2696.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1594.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2219occurred in iteration=22, InterpolantAutomatonStates: 255, 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: 54.2ms SsaConstructionTime, 290.9ms SatisfiabilityAnalysisTime, 1319.6ms InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 3265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...