./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:54:26,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:54:26,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:54:26,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:54:26,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:54:26,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:54:26,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:54:26,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:54:26,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:54:26,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:54:26,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:54:26,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:54:26,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:54:26,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:54:26,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:54:26,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:54:26,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:54:26,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:54:26,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:54:26,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:54:26,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:54:26,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:54:26,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:54:26,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:54:26,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:54:26,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:54:26,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:54:26,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:54:26,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:54:26,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:54:26,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:54:26,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:54:26,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:54:26,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:54:26,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:54:26,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:54:26,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:54:26,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:54:26,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:54:26,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:54:26,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:54:26,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:54:26,981 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:54:26,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:54:26,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:54:26,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:54:26,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:54:27,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:54:27,000 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:54:27,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:54:27,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:54:27,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:54:27,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:54:27,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:54:27,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:54:27,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:54:27,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:54:27,004 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:54:27,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:54:27,005 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:54:27,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:54:27,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:54:27,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:54:27,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:54:27,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:54:27,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:54:27,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:54:27,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:54:27,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:54:27,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:54:27,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:54:27,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:54:27,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:54:27,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:54:27,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2021-11-23 13:54:27,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:54:27,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:54:27,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:54:27,291 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:54:27,292 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:54:27,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-11-23 13:54:27,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/data/77c679bf9/ac6829becdc14e75a657333b49a4ea40/FLAG1523254fc [2021-11-23 13:54:27,904 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:54:27,904 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2021-11-23 13:54:27,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/data/77c679bf9/ac6829becdc14e75a657333b49a4ea40/FLAG1523254fc [2021-11-23 13:54:28,218 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/data/77c679bf9/ac6829becdc14e75a657333b49a4ea40 [2021-11-23 13:54:28,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:54:28,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:54:28,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:54:28,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:54:28,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:54:28,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:28,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409ff646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28, skipping insertion in model container [2021-11-23 13:54:28,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:28,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:54:28,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:54:28,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-11-23 13:54:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-11-23 13:54:28,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:54:28,719 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:54:28,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2021-11-23 13:54:28,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2021-11-23 13:54:28,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:54:28,843 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:54:28,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28 WrapperNode [2021-11-23 13:54:28,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:54:28,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:54:28,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:54:28,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:54:28,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:28,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:28,967 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2021-11-23 13:54:28,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:54:28,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:54:28,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:54:28,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:54:28,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:28,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:54:29,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:54:29,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:54:29,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:54:29,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (1/1) ... [2021-11-23 13:54:29,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:54:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:54:29,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:54:29,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:54:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2021-11-23 13:54:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2021-11-23 13:54:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2021-11-23 13:54:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2021-11-23 13:54:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 13:54:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 13:54:29,161 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2021-11-23 13:54:29,161 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2021-11-23 13:54:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-23 13:54:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:54:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 13:54:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 13:54:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:54:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:54:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:54:29,165 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-23 13:54:29,350 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:54:29,352 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:54:29,740 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:54:29,906 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:54:29,907 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 13:54:29,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:29 BoogieIcfgContainer [2021-11-23 13:54:29,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:54:29,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:54:29,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:54:29,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:54:29,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:54:28" (1/3) ... [2021-11-23 13:54:29,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cee26d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:29, skipping insertion in model container [2021-11-23 13:54:29,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:28" (2/3) ... [2021-11-23 13:54:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cee26d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:29, skipping insertion in model container [2021-11-23 13:54:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:29" (3/3) ... [2021-11-23 13:54:29,917 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2021-11-23 13:54:29,923 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-23 13:54:29,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:54:29,923 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-23 13:54:29,923 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-23 13:54:30,007 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,008 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,008 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,008 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,008 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,009 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,009 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,009 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,009 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,009 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,010 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,010 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,010 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,010 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,011 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,011 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,011 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,011 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,011 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,012 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,012 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,012 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,013 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,013 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,013 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,014 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,014 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,014 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,014 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,015 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,016 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,017 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,018 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,019 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,020 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,021 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,022 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,023 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,024 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,025 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,026 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,027 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,051 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,052 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,053 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,073 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,074 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,074 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,074 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,075 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,075 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,076 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,077 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,078 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,079 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,080 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,081 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,081 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,081 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,081 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,082 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,083 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,084 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,098 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,098 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,103 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,103 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,103 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,103 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,104 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,105 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,105 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,105 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,105 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,106 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,107 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,107 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,108 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,108 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,108 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,108 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,108 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,109 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,110 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,110 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,110 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,110 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,110 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,111 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,112 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,112 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,112 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,112 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,112 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,113 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,114 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,115 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,116 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,116 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,116 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,129 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,164 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,172 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,173 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,174 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,178 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,189 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_#in~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,199 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,199 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,201 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 13:54:30,205 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-23 13:54:30,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:54:30,267 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 13:54:30,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-23 13:54:30,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2021-11-23 13:54:30,365 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2021-11-23 13:54:30,365 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-23 13:54:30,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 18/180 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 134. Up to 4 conditions per place. [2021-11-23 13:54:30,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2021-11-23 13:54:30,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2021-11-23 13:54:30,426 INFO L129 PetriNetUnfolder]: 9/124 cut-off events. [2021-11-23 13:54:30,426 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-23 13:54:30,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:30,427 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:30,428 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2021-11-23 13:54:30,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:30,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760931089] [2021-11-23 13:54:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:30,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:30,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760931089] [2021-11-23 13:54:30,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760931089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:30,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:30,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:54:30,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540212082] [2021-11-23 13:54:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:30,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:30,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:30,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:30,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-11-23 13:54:30,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:30,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:30,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-11-23 13:54:30,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:31,424 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2021-11-23 13:54:31,424 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2021-11-23 13:54:31,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2764 conditions, 1791 events. 629/1791 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12222 event pairs, 272 based on Foata normal form. 180/1804 useless extension candidates. Maximal degree in co-relation 1910. Up to 618 conditions per place. [2021-11-23 13:54:31,459 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2021-11-23 13:54:31,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2021-11-23 13:54:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-11-23 13:54:31,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-11-23 13:54:31,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-11-23 13:54:31,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-11-23 13:54:31,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:31,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-11-23 13:54:31,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:31,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:31,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:31,509 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2021-11-23 13:54:31,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2021-11-23 13:54:31,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-23 13:54:31,525 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2021-11-23 13:54:31,527 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=159, PETRI_TRANSITIONS=163} [2021-11-23 13:54:31,532 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2021-11-23 13:54:31,532 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2021-11-23 13:54:31,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:31,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:31,534 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:31,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:54:31,534 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2021-11-23 13:54:31,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794320238] [2021-11-23 13:54:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:31,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:31,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794320238] [2021-11-23 13:54:31,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794320238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:31,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:31,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:54:31,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243236343] [2021-11-23 13:54:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:31,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:31,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:31,810 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-11-23 13:54:31,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 163 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:31,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:31,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-11-23 13:54:31,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:32,081 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2021-11-23 13:54:32,081 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2021-11-23 13:54:32,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 1255 events. 402/1255 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7965 event pairs, 79 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1163. Up to 395 conditions per place. [2021-11-23 13:54:32,098 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-11-23 13:54:32,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2021-11-23 13:54:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-11-23 13:54:32,100 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-11-23 13:54:32,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:32,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,106 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2021-11-23 13:54:32,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2021-11-23 13:54:32,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-23 13:54:32,118 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2021-11-23 13:54:32,118 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2021-11-23 13:54:32,119 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2021-11-23 13:54:32,120 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2021-11-23 13:54:32,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,121 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:32,121 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:32,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:54:32,122 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2021-11-23 13:54:32,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:32,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17337277] [2021-11-23 13:54:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:32,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:32,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17337277] [2021-11-23 13:54:32,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17337277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:32,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:32,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:54:32,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910779423] [2021-11-23 13:54:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:32,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:32,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:32,320 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-11-23 13:54:32,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,321 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:32,321 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-11-23 13:54:32,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:32,577 INFO L129 PetriNetUnfolder]: 399/1248 cut-off events. [2021-11-23 13:54:32,577 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2021-11-23 13:54:32,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 1248 events. 399/1248 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8024 event pairs, 94 based on Foata normal form. 0/1109 useless extension candidates. Maximal degree in co-relation 1324. Up to 363 conditions per place. [2021-11-23 13:54:32,593 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2021-11-23 13:54:32,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 172 transitions, 429 flow [2021-11-23 13:54:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-11-23 13:54:32,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-11-23 13:54:32,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:32,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-11-23 13:54:32,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,600 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 3 states and 500 transitions. [2021-11-23 13:54:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 172 transitions, 429 flow [2021-11-23 13:54:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 172 transitions, 425 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-23 13:54:32,608 INFO L242 Difference]: Finished difference. Result has 162 places, 163 transitions, 354 flow [2021-11-23 13:54:32,609 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=162, PETRI_TRANSITIONS=163} [2021-11-23 13:54:32,611 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2021-11-23 13:54:32,612 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 354 flow [2021-11-23 13:54:32,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,612 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:32,613 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:32,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:54:32,613 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -671928539, now seen corresponding path program 1 times [2021-11-23 13:54:32,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66267682] [2021-11-23 13:54:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:32,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:32,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:32,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66267682] [2021-11-23 13:54:32,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66267682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:32,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:32,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:54:32,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035346430] [2021-11-23 13:54:32,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:32,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:54:32,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:54:32,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:54:32,818 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-11-23 13:54:32,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 163 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:32,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:32,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-11-23 13:54:32,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:33,370 INFO L129 PetriNetUnfolder]: 779/1959 cut-off events. [2021-11-23 13:54:33,371 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2021-11-23 13:54:33,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1959 events. 779/1959 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13669 event pairs, 110 based on Foata normal form. 96/1979 useless extension candidates. Maximal degree in co-relation 3231. Up to 959 conditions per place. [2021-11-23 13:54:33,398 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 93 selfloop transitions, 31 changer transitions 0/243 dead transitions. [2021-11-23 13:54:33,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 243 transitions, 798 flow [2021-11-23 13:54:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 13:54:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-23 13:54:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2021-11-23 13:54:33,403 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2021-11-23 13:54:33,403 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2021-11-23 13:54:33,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2021-11-23 13:54:33,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:33,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2021-11-23 13:54:33,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.75) internal successors, (1198), 8 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:33,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:33,413 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 183.0) internal successors, (1647), 9 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:33,414 INFO L186 Difference]: Start difference. First operand has 162 places, 163 transitions, 354 flow. Second operand 8 states and 1198 transitions. [2021-11-23 13:54:33,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 243 transitions, 798 flow [2021-11-23 13:54:33,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 243 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-23 13:54:33,452 INFO L242 Difference]: Finished difference. Result has 173 places, 196 transitions, 597 flow [2021-11-23 13:54:33,453 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=173, PETRI_TRANSITIONS=196} [2021-11-23 13:54:33,454 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 13 predicate places. [2021-11-23 13:54:33,454 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 597 flow [2021-11-23 13:54:33,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:33,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:33,455 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:33,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:54:33,455 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash 911682777, now seen corresponding path program 2 times [2021-11-23 13:54:33,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:33,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571867952] [2021-11-23 13:54:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:33,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:33,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:33,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571867952] [2021-11-23 13:54:33,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571867952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:33,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:33,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 13:54:33,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957740558] [2021-11-23 13:54:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:33,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:54:33,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:54:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:54:33,577 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2021-11-23 13:54:33,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 196 transitions, 597 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:33,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:33,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2021-11-23 13:54:33,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:34,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-11-23 13:54:34,788 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2021-11-23 13:54:34,789 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-11-23 13:54:34,789 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2021-11-23 13:54:34,789 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-11-23 13:54:34,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2021-11-23 13:54:34,830 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2021-11-23 13:54:34,830 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2021-11-23 13:54:34,831 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-11-23 13:54:34,831 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:34,904 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 119#L738true, Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 186#(= ~readerprogress1~0 0)]) [2021-11-23 13:54:34,905 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-11-23 13:54:34,905 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-11-23 13:54:34,905 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-11-23 13:54:34,905 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2021-11-23 13:54:34,940 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, Black: 178#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2021-11-23 13:54:34,940 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-11-23 13:54:34,940 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-11-23 13:54:34,940 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:34,940 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2021-11-23 13:54:35,230 INFO L129 PetriNetUnfolder]: 3694/7612 cut-off events. [2021-11-23 13:54:35,230 INFO L130 PetriNetUnfolder]: For 8648/8824 co-relation queries the response was YES. [2021-11-23 13:54:35,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18280 conditions, 7612 events. 3694/7612 cut-off events. For 8648/8824 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 65563 event pairs, 637 based on Foata normal form. 88/7277 useless extension candidates. Maximal degree in co-relation 14398. Up to 2217 conditions per place. [2021-11-23 13:54:35,346 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 172 selfloop transitions, 17 changer transitions 2/319 dead transitions. [2021-11-23 13:54:35,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 319 transitions, 1521 flow [2021-11-23 13:54:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:54:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-23 13:54:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2021-11-23 13:54:35,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2021-11-23 13:54:35,352 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2021-11-23 13:54:35,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2021-11-23 13:54:35,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:35,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2021-11-23 13:54:35,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 138.1) internal successors, (1381), 10 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:35,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:35,364 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:35,364 INFO L186 Difference]: Start difference. First operand has 173 places, 196 transitions, 597 flow. Second operand 10 states and 1381 transitions. [2021-11-23 13:54:35,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 319 transitions, 1521 flow [2021-11-23 13:54:35,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 319 transitions, 1521 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-23 13:54:35,407 INFO L242 Difference]: Finished difference. Result has 187 places, 211 transitions, 700 flow [2021-11-23 13:54:35,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=700, PETRI_PLACES=187, PETRI_TRANSITIONS=211} [2021-11-23 13:54:35,409 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 27 predicate places. [2021-11-23 13:54:35,409 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 211 transitions, 700 flow [2021-11-23 13:54:35,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:35,410 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:35,410 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:35,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:54:35,411 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1278935995, now seen corresponding path program 1 times [2021-11-23 13:54:35,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556887834] [2021-11-23 13:54:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:35,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:35,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556887834] [2021-11-23 13:54:35,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556887834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:35,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:35,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 13:54:35,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836958488] [2021-11-23 13:54:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:35,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 13:54:35,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 13:54:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 13:54:35,573 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2021-11-23 13:54:35,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 211 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:35,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:35,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2021-11-23 13:54:35,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:36,456 INFO L129 PetriNetUnfolder]: 1355/3313 cut-off events. [2021-11-23 13:54:36,456 INFO L130 PetriNetUnfolder]: For 4044/4077 co-relation queries the response was YES. [2021-11-23 13:54:36,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 3313 events. 1355/3313 cut-off events. For 4044/4077 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26918 event pairs, 106 based on Foata normal form. 59/3253 useless extension candidates. Maximal degree in co-relation 8150. Up to 1085 conditions per place. [2021-11-23 13:54:36,513 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 118 selfloop transitions, 37 changer transitions 0/288 dead transitions. [2021-11-23 13:54:36,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 288 transitions, 1330 flow [2021-11-23 13:54:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:54:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-23 13:54:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2021-11-23 13:54:36,519 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027322404371585 [2021-11-23 13:54:36,519 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1469 transitions. [2021-11-23 13:54:36,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1469 transitions. [2021-11-23 13:54:36,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:36,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1469 transitions. [2021-11-23 13:54:36,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.9) internal successors, (1469), 10 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:36,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:36,532 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:36,532 INFO L186 Difference]: Start difference. First operand has 187 places, 211 transitions, 700 flow. Second operand 10 states and 1469 transitions. [2021-11-23 13:54:36,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 288 transitions, 1330 flow [2021-11-23 13:54:36,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 288 transitions, 1330 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-23 13:54:36,568 INFO L242 Difference]: Finished difference. Result has 201 places, 227 transitions, 939 flow [2021-11-23 13:54:36,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=939, PETRI_PLACES=201, PETRI_TRANSITIONS=227} [2021-11-23 13:54:36,572 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2021-11-23 13:54:36,572 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 227 transitions, 939 flow [2021-11-23 13:54:36,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:36,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:36,573 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:36,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:54:36,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -943571459, now seen corresponding path program 1 times [2021-11-23 13:54:36,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:36,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290703602] [2021-11-23 13:54:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:36,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:36,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:36,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290703602] [2021-11-23 13:54:36,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290703602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:36,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:36,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:54:36,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892225426] [2021-11-23 13:54:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:36,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:36,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:36,663 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2021-11-23 13:54:36,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 227 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:36,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:36,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2021-11-23 13:54:36,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:37,224 INFO L129 PetriNetUnfolder]: 952/2875 cut-off events. [2021-11-23 13:54:37,224 INFO L130 PetriNetUnfolder]: For 4069/4222 co-relation queries the response was YES. [2021-11-23 13:54:37,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 2875 events. 952/2875 cut-off events. For 4069/4222 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 24345 event pairs, 179 based on Foata normal form. 76/2744 useless extension candidates. Maximal degree in co-relation 6752. Up to 801 conditions per place. [2021-11-23 13:54:37,277 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2021-11-23 13:54:37,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 247 transitions, 1198 flow [2021-11-23 13:54:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-11-23 13:54:37,279 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2021-11-23 13:54:37,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-11-23 13:54:37,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-11-23 13:54:37,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:37,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-11-23 13:54:37,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:37,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:37,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:37,284 INFO L186 Difference]: Start difference. First operand has 201 places, 227 transitions, 939 flow. Second operand 3 states and 500 transitions. [2021-11-23 13:54:37,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 247 transitions, 1198 flow [2021-11-23 13:54:37,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 247 transitions, 1175 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-11-23 13:54:37,303 INFO L242 Difference]: Finished difference. Result has 200 places, 227 transitions, 923 flow [2021-11-23 13:54:37,303 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=200, PETRI_TRANSITIONS=227} [2021-11-23 13:54:37,304 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 40 predicate places. [2021-11-23 13:54:37,304 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 227 transitions, 923 flow [2021-11-23 13:54:37,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:37,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:37,305 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:37,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:54:37,305 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash 569723890, now seen corresponding path program 1 times [2021-11-23 13:54:37,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:37,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624659613] [2021-11-23 13:54:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:37,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:37,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624659613] [2021-11-23 13:54:37,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624659613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:37,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:37,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:54:37,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174565196] [2021-11-23 13:54:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:37,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:54:37,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:54:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:54:37,415 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:54:37,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 227 transitions, 923 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:37,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:37,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:54:37,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:38,423 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,423 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,424 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,424 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,424 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,425 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,425 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,425 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,425 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,425 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-11-23 13:54:38,682 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,682 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,682 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,682 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,682 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,683 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,683 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,683 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,683 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,683 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,684 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][229], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 166#L771-3true, 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,684 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,684 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,684 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,684 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,685 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,685 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,685 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,686 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,686 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2021-11-23 13:54:38,686 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,686 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,686 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,687 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,687 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,687 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][231], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:38,687 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,687 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,688 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,688 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,786 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:38,786 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2021-11-23 13:54:38,786 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:38,786 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:38,787 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-11-23 13:54:38,829 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:38,829 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-11-23 13:54:38,829 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,829 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:38,829 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:38,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:38,830 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-11-23 13:54:38,830 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:38,830 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:38,830 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:38,998 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:38,999 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-11-23 13:54:38,999 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:38,999 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:38,999 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:39,076 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:39,077 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-11-23 13:54:39,077 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-23 13:54:39,077 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:39,077 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2021-11-23 13:54:39,148 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 84#L787-1true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= ~ctr1~0 1), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:39,148 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:39,148 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:39,148 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:39,149 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:39,150 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][236], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:39,150 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:39,150 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:39,150 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:39,150 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:39,212 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][294], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 91#L777true, 84#L787-1true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 196#(= ~ctr1~0 1), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, 255#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:39,213 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-11-23 13:54:39,213 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:39,213 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:39,213 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:39,723 INFO L129 PetriNetUnfolder]: 5267/11896 cut-off events. [2021-11-23 13:54:39,723 INFO L130 PetriNetUnfolder]: For 14159/14513 co-relation queries the response was YES. [2021-11-23 13:54:39,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29605 conditions, 11896 events. 5267/11896 cut-off events. For 14159/14513 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 115189 event pairs, 662 based on Foata normal form. 173/11271 useless extension candidates. Maximal degree in co-relation 28072. Up to 2324 conditions per place. [2021-11-23 13:54:39,849 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 159 selfloop transitions, 12 changer transitions 6/336 dead transitions. [2021-11-23 13:54:39,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 1840 flow [2021-11-23 13:54:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:54:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-23 13:54:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1069 transitions. [2021-11-23 13:54:39,854 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.834504293520687 [2021-11-23 13:54:39,854 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1069 transitions. [2021-11-23 13:54:39,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1069 transitions. [2021-11-23 13:54:39,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:39,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1069 transitions. [2021-11-23 13:54:39,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.71428571428572) internal successors, (1069), 7 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:39,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:39,862 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:39,863 INFO L186 Difference]: Start difference. First operand has 200 places, 227 transitions, 923 flow. Second operand 7 states and 1069 transitions. [2021-11-23 13:54:39,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 1840 flow [2021-11-23 13:54:39,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 336 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-23 13:54:39,970 INFO L242 Difference]: Finished difference. Result has 207 places, 237 transitions, 994 flow [2021-11-23 13:54:39,970 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=207, PETRI_TRANSITIONS=237} [2021-11-23 13:54:39,971 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2021-11-23 13:54:39,971 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 237 transitions, 994 flow [2021-11-23 13:54:39,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:39,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:39,972 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:39,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:54:39,973 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1129125278, now seen corresponding path program 1 times [2021-11-23 13:54:39,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:39,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333475150] [2021-11-23 13:54:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:39,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:40,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:40,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333475150] [2021-11-23 13:54:40,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333475150] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:40,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:40,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:54:40,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441064588] [2021-11-23 13:54:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:40,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:54:40,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:54:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:54:40,036 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:54:40,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 237 transitions, 994 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:40,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:40,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:54:40,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:41,517 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 84#L787-1true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,518 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,518 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,518 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,518 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,518 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), 51#L772-2true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,518 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,519 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,519 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,519 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-11-23 13:54:41,586 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,586 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-11-23 13:54:41,586 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:41,586 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,586 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:41,638 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 262#(= ~readerprogress2~0 0), Black: 196#(= ~ctr1~0 1), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,639 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,639 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,639 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,639 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:41,673 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [274#true, 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 266#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 234#true, 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,673 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2021-11-23 13:54:41,673 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:41,674 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:41,674 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:41,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,677 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,677 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,677 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,677 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), 51#L772-2true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,677 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,677 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,678 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,678 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2021-11-23 13:54:41,733 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 191#(= ~readerprogress2~0 0), 274#true, 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 234#true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,733 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,734 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:41,734 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:41,734 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-11-23 13:54:41,742 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 168#L772-6true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,742 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2021-11-23 13:54:41,742 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-11-23 13:54:41,742 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-11-23 13:54:41,742 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2021-11-23 13:54:41,744 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,744 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,744 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,744 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,744 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:41,751 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][231], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), Black: 196#(= ~ctr1~0 1), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 68#L725-3true, 223#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,751 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,751 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,752 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:41,752 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:41,788 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 276#(= ~readerprogress2~0 2), 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 234#true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,788 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,789 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,789 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,789 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,789 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [274#true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 266#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), 234#true, 52#L744-3true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,790 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,790 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,790 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,790 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:41,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,795 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,795 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,796 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,796 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,796 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), 51#L772-2true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:41,797 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,797 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,797 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,797 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2021-11-23 13:54:41,811 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 119#L738true, Black: 262#(= ~readerprogress2~0 0), Black: 196#(= ~ctr1~0 1), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,811 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,811 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,812 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:41,812 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:41,977 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 191#(= ~readerprogress2~0 0), 274#true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 234#true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,977 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2021-11-23 13:54:41,977 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:41,978 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:41,978 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:41,986 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 274#true, 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 266#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,987 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-11-23 13:54:41,987 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:41,987 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:41,987 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:41,993 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:41,993 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-11-23 13:54:41,993 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:41,993 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:41,994 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,007 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,007 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,007 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,007 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,008 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,014 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][226], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), 211#true, Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,014 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L771-2-->L771-3: Formula: (= v_~ctr2~0_19 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|} OutVars{qrcu_updaterThread1of1ForFork0_#t~post16#1=|v_qrcu_updaterThread1of1ForFork0_#t~post16#1_3|, ~ctr2~0=v_~ctr2~0_19} AuxVars[] AssignedVars[~ctr2~0][226], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), 211#true, Black: 262#(= ~readerprogress2~0 0), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,015 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,015 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,016 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][227], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), 211#true, Black: 262#(= ~readerprogress2~0 0), 51#L772-2true, Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,016 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,016 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:42,016 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2021-11-23 13:54:42,016 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:42,016 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= v_~ctr1~0_20 (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1)) InVars {qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} OutVars{~ctr1~0=v_~ctr1~0_20, qrcu_updaterThread1of1ForFork0_#t~post18#1=|v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3|} AuxVars[] AssignedVars[~ctr1~0][227], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), 211#true, Black: 262#(= ~readerprogress2~0 0), 51#L772-2true, Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,016 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,017 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,017 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,017 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,044 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 276#(= ~readerprogress2~0 2), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 234#true, qrcu_updaterThread1of1ForFork0InUse, Black: 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,044 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,044 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,045 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,045 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2021-11-23 13:54:42,049 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 109#L787-2true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 168#L772-6true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,050 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is not cut-off event [2021-11-23 13:54:42,050 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-11-23 13:54:42,050 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-11-23 13:54:42,050 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2021-11-23 13:54:42,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 274#true, 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,053 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2021-11-23 13:54:42,053 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-23 13:54:42,053 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-23 13:54:42,053 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2021-11-23 13:54:42,053 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [111#L739-3true, Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 84#L787-1true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,054 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,054 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,054 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,054 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,054 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-11-23 13:54:42,127 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,127 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,127 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,128 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,128 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,161 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L758-->L758-3: Formula: (and (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|) (let ((.cse0 (<= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1| 0))) (or (and (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|) (= (+ v_~ctr1~0_86 1) v_~ctr1~0_87) (= v_~ctr2~0_89 v_~ctr2~0_88) .cse0) (and (= (+ v_~ctr2~0_88 1) v_~ctr2~0_89) (= v_~ctr1~0_87 v_~ctr1~0_86) (not .cse0) (= |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|)))) (= |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1| |v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|)) InVars {~ctr1~0=v_~ctr1~0_87, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, ~ctr2~0=v_~ctr2~0_89} OutVars{qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1_1|, qrcu_reader2Thread1of1ForFork2_~myidx~1#1=|v_qrcu_reader2Thread1of1ForFork2_~myidx~1#1_5|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1_1|, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1=|v_qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1_1|, ~ctr1~0=v_~ctr1~0_86, ~ctr2~0=v_~ctr2~0_88} AuxVars[|v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post6#1_29|, |v_qrcu_reader2___VERIFIER_atomic_use_done_#t~post5#1_29|] AssignedVars[qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1, qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1, ~ctr1~0, ~ctr2~0][137], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 168#L772-6true, 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:42,161 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-11-23 13:54:42,161 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-11-23 13:54:42,161 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-11-23 13:54:42,161 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-11-23 13:54:42,205 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 59#L758true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,205 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,210 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,210 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,210 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,210 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,211 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 274#true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), 266#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0)), qrcu_updaterThread1of1ForFork0InUse, 52#L744-3true, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,211 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2021-11-23 13:54:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,212 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2021-11-23 13:54:42,212 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][218], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 274#true, 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), 29#L757true, Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,213 INFO L384 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2021-11-23 13:54:42,213 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:42,213 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:42,213 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2021-11-23 13:54:42,327 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([834] L769-1-->L777: Formula: (= |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1| (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|)) InVars {#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_1|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|, qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset=|v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_#t~mem20#1][280], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 91#L777true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 263#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= ~ctr1~0 1), Black: 262#(= ~readerprogress2~0 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 270#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), 120#L788-1true, 59#L758true, Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 221#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:42,327 INFO L384 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,327 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,327 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,327 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,327 INFO L387 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2021-11-23 13:54:42,514 INFO L129 PetriNetUnfolder]: 6360/14335 cut-off events. [2021-11-23 13:54:42,514 INFO L130 PetriNetUnfolder]: For 18048/18953 co-relation queries the response was YES. [2021-11-23 13:54:42,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36906 conditions, 14335 events. 6360/14335 cut-off events. For 18048/18953 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 144723 event pairs, 1191 based on Foata normal form. 265/13499 useless extension candidates. Maximal degree in co-relation 34984. Up to 4035 conditions per place. [2021-11-23 13:54:42,795 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 136 selfloop transitions, 6 changer transitions 15/316 dead transitions. [2021-11-23 13:54:42,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 316 transitions, 1717 flow [2021-11-23 13:54:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:54:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-23 13:54:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 774 transitions. [2021-11-23 13:54:42,799 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8459016393442623 [2021-11-23 13:54:42,799 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 774 transitions. [2021-11-23 13:54:42,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 774 transitions. [2021-11-23 13:54:42,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:42,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 774 transitions. [2021-11-23 13:54:42,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:42,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:42,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:42,805 INFO L186 Difference]: Start difference. First operand has 207 places, 237 transitions, 994 flow. Second operand 5 states and 774 transitions. [2021-11-23 13:54:42,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 316 transitions, 1717 flow [2021-11-23 13:54:42,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 316 transitions, 1717 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-23 13:54:42,926 INFO L242 Difference]: Finished difference. Result has 214 places, 242 transitions, 1057 flow [2021-11-23 13:54:42,927 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=214, PETRI_TRANSITIONS=242} [2021-11-23 13:54:42,928 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 54 predicate places. [2021-11-23 13:54:42,928 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 242 transitions, 1057 flow [2021-11-23 13:54:42,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:42,930 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:42,930 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:42,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 13:54:42,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1045246048, now seen corresponding path program 1 times [2021-11-23 13:54:42,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:42,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592270567] [2021-11-23 13:54:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:42,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:42,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:42,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592270567] [2021-11-23 13:54:42,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592270567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:42,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:42,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:54:42,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954245124] [2021-11-23 13:54:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:42,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:42,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:42,981 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-11-23 13:54:42,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 242 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:42,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:42,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-11-23 13:54:42,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:44,574 INFO L129 PetriNetUnfolder]: 3145/9814 cut-off events. [2021-11-23 13:54:44,575 INFO L130 PetriNetUnfolder]: For 10280/10512 co-relation queries the response was YES. [2021-11-23 13:54:44,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21728 conditions, 9814 events. 3145/9814 cut-off events. For 10280/10512 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 105124 event pairs, 747 based on Foata normal form. 55/9038 useless extension candidates. Maximal degree in co-relation 21338. Up to 3120 conditions per place. [2021-11-23 13:54:44,657 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 60 selfloop transitions, 1 changer transitions 48/261 dead transitions. [2021-11-23 13:54:44,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 261 transitions, 1309 flow [2021-11-23 13:54:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2021-11-23 13:54:44,660 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2021-11-23 13:54:44,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2021-11-23 13:54:44,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2021-11-23 13:54:44,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:44,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2021-11-23 13:54:44,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:44,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:44,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:44,665 INFO L186 Difference]: Start difference. First operand has 214 places, 242 transitions, 1057 flow. Second operand 3 states and 494 transitions. [2021-11-23 13:54:44,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 261 transitions, 1309 flow [2021-11-23 13:54:44,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 261 transitions, 1298 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-11-23 13:54:44,746 INFO L242 Difference]: Finished difference. Result has 216 places, 199 transitions, 775 flow [2021-11-23 13:54:44,747 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2021-11-23 13:54:44,748 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 56 predicate places. [2021-11-23 13:54:44,749 INFO L470 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 775 flow [2021-11-23 13:54:44,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:44,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:44,749 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:44,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:54:44,750 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2021-11-23 13:54:44,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445798547] [2021-11-23 13:54:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:44,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:44,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445798547] [2021-11-23 13:54:44,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445798547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:44,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:44,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:54:44,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642653479] [2021-11-23 13:54:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:44,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:54:44,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:54:44,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:54:44,834 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2021-11-23 13:54:44,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:44,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:44,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2021-11-23 13:54:44,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:45,790 INFO L129 PetriNetUnfolder]: 1385/4471 cut-off events. [2021-11-23 13:54:45,790 INFO L130 PetriNetUnfolder]: For 4137/4188 co-relation queries the response was YES. [2021-11-23 13:54:45,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10227 conditions, 4471 events. 1385/4471 cut-off events. For 4137/4188 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 44061 event pairs, 370 based on Foata normal form. 14/4243 useless extension candidates. Maximal degree in co-relation 9917. Up to 1464 conditions per place. [2021-11-23 13:54:45,819 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 71 selfloop transitions, 31 changer transitions 11/257 dead transitions. [2021-11-23 13:54:45,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 257 transitions, 1300 flow [2021-11-23 13:54:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 13:54:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-23 13:54:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-11-23 13:54:45,824 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87743950039032 [2021-11-23 13:54:45,824 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-11-23 13:54:45,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-11-23 13:54:45,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:45,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-11-23 13:54:45,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:45,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:45,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:45,833 INFO L186 Difference]: Start difference. First operand has 216 places, 199 transitions, 775 flow. Second operand 7 states and 1124 transitions. [2021-11-23 13:54:45,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 257 transitions, 1300 flow [2021-11-23 13:54:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 257 transitions, 1248 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-11-23 13:54:45,866 INFO L242 Difference]: Finished difference. Result has 205 places, 214 transitions, 958 flow [2021-11-23 13:54:45,867 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=958, PETRI_PLACES=205, PETRI_TRANSITIONS=214} [2021-11-23 13:54:45,868 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 45 predicate places. [2021-11-23 13:54:45,868 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 214 transitions, 958 flow [2021-11-23 13:54:45,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:45,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:45,869 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:45,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 13:54:45,869 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1402509722, now seen corresponding path program 1 times [2021-11-23 13:54:45,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:45,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713036868] [2021-11-23 13:54:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:45,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:45,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:45,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713036868] [2021-11-23 13:54:45,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713036868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:45,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:45,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:54:45,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784753183] [2021-11-23 13:54:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:45,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:54:45,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:54:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:54:45,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2021-11-23 13:54:45,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 214 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:45,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:45,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2021-11-23 13:54:45,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:46,291 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [111#L739-3true, 308#(= ~idx~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 292#true, 79#L771-1true, 276#(= ~readerprogress2~0 2), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 101#L786-4true, 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 280#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), Black: 289#(= ~idx~0 1), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 294#(= ~ctr2~0 0), Black: 296#(<= 1 ~ctr2~0), Black: 295#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:46,291 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2021-11-23 13:54:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-11-23 13:54:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-11-23 13:54:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2021-11-23 13:54:46,356 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [308#(= ~idx~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 292#true, 79#L771-1true, 276#(= ~readerprogress2~0 2), 109#L787-2true, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 280#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), Black: 289#(= ~idx~0 1), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 294#(= ~ctr2~0 0), Black: 296#(<= 1 ~ctr2~0), Black: 295#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 55#L758-3true]) [2021-11-23 13:54:46,357 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-11-23 13:54:46,357 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2021-11-23 13:54:46,357 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:46,357 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2021-11-23 13:54:46,403 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L771-->L771-1: Formula: (<= v_~idx~0_5 0) InVars {~idx~0=v_~idx~0_5} OutVars{~idx~0=v_~idx~0_5} AuxVars[] AssignedVars[][146], [308#(= ~idx~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 292#true, 79#L771-1true, 276#(= ~readerprogress2~0 2), 87#L788-2true, Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 262#(= ~readerprogress2~0 0), 260#true, Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), 194#true, 180#(< 1 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 257#(= ~readerprogress1~0 2), Black: 280#(and (= ~readerprogress2~0 2) (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 2)), Black: 289#(= ~idx~0 1), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 225#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), Black: 213#(= ~readerprogress1~0 0), Black: 219#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0) (not (= |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|))), qrcu_updaterThread1of1ForFork0InUse, Black: 294#(= ~ctr2~0 0), Black: 296#(<= 1 ~ctr2~0), Black: 295#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 178#true, Black: 244#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), Black: 238#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 216#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), Black: 234#true, Black: 246#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0))]) [2021-11-23 13:54:46,403 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2021-11-23 13:54:46,403 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-11-23 13:54:46,403 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:46,403 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-11-23 13:54:46,429 INFO L129 PetriNetUnfolder]: 879/3238 cut-off events. [2021-11-23 13:54:46,430 INFO L130 PetriNetUnfolder]: For 5396/5473 co-relation queries the response was YES. [2021-11-23 13:54:46,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7914 conditions, 3238 events. 879/3238 cut-off events. For 5396/5473 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 29430 event pairs, 209 based on Foata normal form. 14/3084 useless extension candidates. Maximal degree in co-relation 7588. Up to 823 conditions per place. [2021-11-23 13:54:46,456 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 57 selfloop transitions, 2 changer transitions 5/210 dead transitions. [2021-11-23 13:54:46,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 210 transitions, 1082 flow [2021-11-23 13:54:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:54:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-23 13:54:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-11-23 13:54:46,459 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-11-23 13:54:46,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-11-23 13:54:46,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-11-23 13:54:46,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:46,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-11-23 13:54:46,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:46,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:46,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:46,463 INFO L186 Difference]: Start difference. First operand has 205 places, 214 transitions, 958 flow. Second operand 3 states and 488 transitions. [2021-11-23 13:54:46,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 210 transitions, 1082 flow [2021-11-23 13:54:46,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 210 transitions, 1065 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-11-23 13:54:46,494 INFO L242 Difference]: Finished difference. Result has 196 places, 190 transitions, 804 flow [2021-11-23 13:54:46,495 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=196, PETRI_TRANSITIONS=190} [2021-11-23 13:54:46,495 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 36 predicate places. [2021-11-23 13:54:46,496 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 190 transitions, 804 flow [2021-11-23 13:54:46,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:46,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:46,496 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:46,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 13:54:46,497 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2131711090, now seen corresponding path program 1 times [2021-11-23 13:54:46,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306264867] [2021-11-23 13:54:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:46,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:46,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:46,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306264867] [2021-11-23 13:54:46,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306264867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:46,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:46,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:54:46,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834180579] [2021-11-23 13:54:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:46,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:54:46,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:54:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:54:46,699 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:46,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 190 transitions, 804 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:46,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:46,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:46,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:47,832 INFO L129 PetriNetUnfolder]: 1962/4846 cut-off events. [2021-11-23 13:54:47,833 INFO L130 PetriNetUnfolder]: For 9341/9440 co-relation queries the response was YES. [2021-11-23 13:54:47,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14492 conditions, 4846 events. 1962/4846 cut-off events. For 9341/9440 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 41632 event pairs, 460 based on Foata normal form. 70/4785 useless extension candidates. Maximal degree in co-relation 14207. Up to 2075 conditions per place. [2021-11-23 13:54:47,869 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 134 selfloop transitions, 46 changer transitions 7/297 dead transitions. [2021-11-23 13:54:47,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 297 transitions, 1866 flow [2021-11-23 13:54:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 13:54:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-23 13:54:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2021-11-23 13:54:47,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2021-11-23 13:54:47,875 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2021-11-23 13:54:47,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2021-11-23 13:54:47,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:47,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2021-11-23 13:54:47,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.72727272727272) internal successors, (1493), 11 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:47,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:47,887 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:47,887 INFO L186 Difference]: Start difference. First operand has 196 places, 190 transitions, 804 flow. Second operand 11 states and 1493 transitions. [2021-11-23 13:54:47,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 297 transitions, 1866 flow [2021-11-23 13:54:47,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 297 transitions, 1862 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-23 13:54:47,937 INFO L242 Difference]: Finished difference. Result has 208 places, 216 transitions, 1237 flow [2021-11-23 13:54:47,938 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1237, PETRI_PLACES=208, PETRI_TRANSITIONS=216} [2021-11-23 13:54:47,938 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2021-11-23 13:54:47,938 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 216 transitions, 1237 flow [2021-11-23 13:54:47,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:47,939 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:47,940 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:47,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 13:54:47,940 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1080344130, now seen corresponding path program 2 times [2021-11-23 13:54:47,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:47,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612568453] [2021-11-23 13:54:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:47,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:48,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:48,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612568453] [2021-11-23 13:54:48,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612568453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:48,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:48,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:54:48,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467734218] [2021-11-23 13:54:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:48,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:54:48,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:54:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:54:48,113 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:48,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 216 transitions, 1237 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:48,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:48,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:48,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:49,292 INFO L129 PetriNetUnfolder]: 2012/5101 cut-off events. [2021-11-23 13:54:49,292 INFO L130 PetriNetUnfolder]: For 14152/14266 co-relation queries the response was YES. [2021-11-23 13:54:49,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16616 conditions, 5101 events. 2012/5101 cut-off events. For 14152/14266 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 44854 event pairs, 522 based on Foata normal form. 95/5032 useless extension candidates. Maximal degree in co-relation 16315. Up to 1993 conditions per place. [2021-11-23 13:54:49,342 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 132 selfloop transitions, 65 changer transitions 31/338 dead transitions. [2021-11-23 13:54:49,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 338 transitions, 2609 flow [2021-11-23 13:54:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 13:54:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-23 13:54:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2021-11-23 13:54:49,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2021-11-23 13:54:49,348 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2021-11-23 13:54:49,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2021-11-23 13:54:49,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:49,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2021-11-23 13:54:49,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 134.84615384615384) internal successors, (1753), 13 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:49,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:49,365 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:49,365 INFO L186 Difference]: Start difference. First operand has 208 places, 216 transitions, 1237 flow. Second operand 13 states and 1753 transitions. [2021-11-23 13:54:49,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 338 transitions, 2609 flow [2021-11-23 13:54:49,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 338 transitions, 2546 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-11-23 13:54:49,450 INFO L242 Difference]: Finished difference. Result has 220 places, 232 transitions, 1605 flow [2021-11-23 13:54:49,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1605, PETRI_PLACES=220, PETRI_TRANSITIONS=232} [2021-11-23 13:54:49,451 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 60 predicate places. [2021-11-23 13:54:49,451 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 232 transitions, 1605 flow [2021-11-23 13:54:49,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:49,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:49,453 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:49,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 13:54:49,453 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1730288442, now seen corresponding path program 1 times [2021-11-23 13:54:49,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464999137] [2021-11-23 13:54:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:49,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:49,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:49,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464999137] [2021-11-23 13:54:49,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464999137] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:49,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:49,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 13:54:49,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249827674] [2021-11-23 13:54:49,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:49,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 13:54:49,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 13:54:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:54:49,619 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:49,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 232 transitions, 1605 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:49,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:49,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:49,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:50,806 INFO L129 PetriNetUnfolder]: 1798/4730 cut-off events. [2021-11-23 13:54:50,806 INFO L130 PetriNetUnfolder]: For 19454/19593 co-relation queries the response was YES. [2021-11-23 13:54:50,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16193 conditions, 4730 events. 1798/4730 cut-off events. For 19454/19593 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 41999 event pairs, 359 based on Foata normal form. 130/4701 useless extension candidates. Maximal degree in co-relation 15903. Up to 1224 conditions per place. [2021-11-23 13:54:50,847 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 145 selfloop transitions, 65 changer transitions 12/332 dead transitions. [2021-11-23 13:54:50,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 332 transitions, 2683 flow [2021-11-23 13:54:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 13:54:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-23 13:54:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2248 transitions. [2021-11-23 13:54:50,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7225972356155577 [2021-11-23 13:54:50,856 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2248 transitions. [2021-11-23 13:54:50,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2248 transitions. [2021-11-23 13:54:50,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:50,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2248 transitions. [2021-11-23 13:54:50,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 132.23529411764707) internal successors, (2248), 17 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:50,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:50,873 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:50,873 INFO L186 Difference]: Start difference. First operand has 220 places, 232 transitions, 1605 flow. Second operand 17 states and 2248 transitions. [2021-11-23 13:54:50,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 332 transitions, 2683 flow [2021-11-23 13:54:50,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 332 transitions, 2612 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-11-23 13:54:50,966 INFO L242 Difference]: Finished difference. Result has 236 places, 244 transitions, 1827 flow [2021-11-23 13:54:50,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1827, PETRI_PLACES=236, PETRI_TRANSITIONS=244} [2021-11-23 13:54:50,968 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 76 predicate places. [2021-11-23 13:54:50,968 INFO L470 AbstractCegarLoop]: Abstraction has has 236 places, 244 transitions, 1827 flow [2021-11-23 13:54:50,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:50,969 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:50,969 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:50,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:54:50,969 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash 560799056, now seen corresponding path program 3 times [2021-11-23 13:54:50,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:50,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797281615] [2021-11-23 13:54:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:50,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:51,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:51,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797281615] [2021-11-23 13:54:51,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797281615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:51,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:51,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:54:51,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313577637] [2021-11-23 13:54:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:51,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:54:51,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:54:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:54:51,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:51,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 244 transitions, 1827 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:51,144 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:51,144 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:51,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:52,245 INFO L129 PetriNetUnfolder]: 1719/4566 cut-off events. [2021-11-23 13:54:52,245 INFO L130 PetriNetUnfolder]: For 22939/23103 co-relation queries the response was YES. [2021-11-23 13:54:52,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16220 conditions, 4566 events. 1719/4566 cut-off events. For 22939/23103 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 40580 event pairs, 511 based on Foata normal form. 141/4557 useless extension candidates. Maximal degree in co-relation 15925. Up to 1655 conditions per place. [2021-11-23 13:54:52,283 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 158 selfloop transitions, 65 changer transitions 15/348 dead transitions. [2021-11-23 13:54:52,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 348 transitions, 3042 flow [2021-11-23 13:54:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:54:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:54:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2021-11-23 13:54:52,288 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2021-11-23 13:54:52,288 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2021-11-23 13:54:52,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2021-11-23 13:54:52,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:52,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2021-11-23 13:54:52,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.08333333333334) internal successors, (1633), 12 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:52,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:52,299 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:52,300 INFO L186 Difference]: Start difference. First operand has 236 places, 244 transitions, 1827 flow. Second operand 12 states and 1633 transitions. [2021-11-23 13:54:52,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 348 transitions, 3042 flow [2021-11-23 13:54:52,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 348 transitions, 3005 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-11-23 13:54:52,428 INFO L242 Difference]: Finished difference. Result has 247 places, 253 transitions, 2131 flow [2021-11-23 13:54:52,428 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2131, PETRI_PLACES=247, PETRI_TRANSITIONS=253} [2021-11-23 13:54:52,429 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 87 predicate places. [2021-11-23 13:54:52,429 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 253 transitions, 2131 flow [2021-11-23 13:54:52,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:52,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:52,430 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:52,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 13:54:52,431 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:52,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash -764322864, now seen corresponding path program 2 times [2021-11-23 13:54:52,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:52,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713566584] [2021-11-23 13:54:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:52,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:52,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713566584] [2021-11-23 13:54:52,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713566584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:52,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:52,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 13:54:52,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012934605] [2021-11-23 13:54:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:52,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 13:54:52,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 13:54:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:54:52,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:52,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 253 transitions, 2131 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:52,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:52,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:52,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:53,926 INFO L129 PetriNetUnfolder]: 1685/4531 cut-off events. [2021-11-23 13:54:53,926 INFO L130 PetriNetUnfolder]: For 29018/29198 co-relation queries the response was YES. [2021-11-23 13:54:53,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16965 conditions, 4531 events. 1685/4531 cut-off events. For 29018/29198 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 40585 event pairs, 345 based on Foata normal form. 150/4534 useless extension candidates. Maximal degree in co-relation 16664. Up to 1009 conditions per place. [2021-11-23 13:54:53,967 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 157 selfloop transitions, 68 changer transitions 31/366 dead transitions. [2021-11-23 13:54:53,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 366 transitions, 3457 flow [2021-11-23 13:54:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 13:54:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-23 13:54:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2021-11-23 13:54:53,972 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2021-11-23 13:54:53,972 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2021-11-23 13:54:53,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2021-11-23 13:54:53,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:53,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2021-11-23 13:54:53,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:53,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:53,985 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:53,985 INFO L186 Difference]: Start difference. First operand has 247 places, 253 transitions, 2131 flow. Second operand 16 states and 2144 transitions. [2021-11-23 13:54:53,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 366 transitions, 3457 flow [2021-11-23 13:54:54,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 366 transitions, 3362 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-11-23 13:54:54,128 INFO L242 Difference]: Finished difference. Result has 262 places, 257 transitions, 2303 flow [2021-11-23 13:54:54,129 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2303, PETRI_PLACES=262, PETRI_TRANSITIONS=257} [2021-11-23 13:54:54,130 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 102 predicate places. [2021-11-23 13:54:54,130 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 257 transitions, 2303 flow [2021-11-23 13:54:54,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:54,130 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:54,130 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:54,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 13:54:54,131 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1085664356, now seen corresponding path program 3 times [2021-11-23 13:54:54,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:54,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817464396] [2021-11-23 13:54:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:54,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:54,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817464396] [2021-11-23 13:54:54,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817464396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:54,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:54,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 13:54:54,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946981006] [2021-11-23 13:54:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:54,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 13:54:54,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 13:54:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:54:54,290 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:54,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 257 transitions, 2303 flow. Second operand has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:54,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:54,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:54,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:55,703 INFO L129 PetriNetUnfolder]: 1657/4461 cut-off events. [2021-11-23 13:54:55,704 INFO L130 PetriNetUnfolder]: For 35171/35338 co-relation queries the response was YES. [2021-11-23 13:54:55,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17149 conditions, 4461 events. 1657/4461 cut-off events. For 35171/35338 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 39742 event pairs, 343 based on Foata normal form. 151/4472 useless extension candidates. Maximal degree in co-relation 16843. Up to 1014 conditions per place. [2021-11-23 13:54:55,775 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 143 selfloop transitions, 79 changer transitions 11/343 dead transitions. [2021-11-23 13:54:55,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 343 transitions, 3304 flow [2021-11-23 13:54:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 13:54:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-23 13:54:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2366 transitions. [2021-11-23 13:54:55,779 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7182756527018822 [2021-11-23 13:54:55,779 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2366 transitions. [2021-11-23 13:54:55,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2366 transitions. [2021-11-23 13:54:55,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:55,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2366 transitions. [2021-11-23 13:54:55,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.44444444444446) internal successors, (2366), 18 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:55,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:55,793 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:55,793 INFO L186 Difference]: Start difference. First operand has 262 places, 257 transitions, 2303 flow. Second operand 18 states and 2366 transitions. [2021-11-23 13:54:55,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 343 transitions, 3304 flow [2021-11-23 13:54:55,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 343 transitions, 3220 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-11-23 13:54:55,974 INFO L242 Difference]: Finished difference. Result has 277 places, 264 transitions, 2532 flow [2021-11-23 13:54:55,975 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2532, PETRI_PLACES=277, PETRI_TRANSITIONS=264} [2021-11-23 13:54:55,976 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2021-11-23 13:54:55,976 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 264 transitions, 2532 flow [2021-11-23 13:54:55,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:55,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:55,977 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:55,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 13:54:55,977 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1354881048, now seen corresponding path program 1 times [2021-11-23 13:54:55,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:55,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139177095] [2021-11-23 13:54:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:55,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:56,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:56,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139177095] [2021-11-23 13:54:56,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139177095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:56,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:56,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:54:56,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288711930] [2021-11-23 13:54:56,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:56,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:54:56,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:56,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:54:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:54:56,125 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:56,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 264 transitions, 2532 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:56,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:56,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:56,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:57,375 INFO L129 PetriNetUnfolder]: 1613/4445 cut-off events. [2021-11-23 13:54:57,376 INFO L130 PetriNetUnfolder]: For 41272/41561 co-relation queries the response was YES. [2021-11-23 13:54:57,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18047 conditions, 4445 events. 1613/4445 cut-off events. For 41272/41561 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 39534 event pairs, 186 based on Foata normal form. 243/4547 useless extension candidates. Maximal degree in co-relation 17742. Up to 1148 conditions per place. [2021-11-23 13:54:57,433 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 180 selfloop transitions, 64 changer transitions 30/384 dead transitions. [2021-11-23 13:54:57,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 384 transitions, 4138 flow [2021-11-23 13:54:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:54:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:54:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2021-11-23 13:54:57,435 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2021-11-23 13:54:57,435 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2021-11-23 13:54:57,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2021-11-23 13:54:57,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:57,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2021-11-23 13:54:57,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 136.58333333333334) internal successors, (1639), 12 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:57,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:57,440 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:57,440 INFO L186 Difference]: Start difference. First operand has 277 places, 264 transitions, 2532 flow. Second operand 12 states and 1639 transitions. [2021-11-23 13:54:57,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 384 transitions, 4138 flow [2021-11-23 13:54:57,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 384 transitions, 3937 flow, removed 56 selfloop flow, removed 9 redundant places. [2021-11-23 13:54:57,620 INFO L242 Difference]: Finished difference. Result has 284 places, 281 transitions, 2871 flow [2021-11-23 13:54:57,621 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2871, PETRI_PLACES=284, PETRI_TRANSITIONS=281} [2021-11-23 13:54:57,621 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 124 predicate places. [2021-11-23 13:54:57,621 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 281 transitions, 2871 flow [2021-11-23 13:54:57,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:57,622 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:57,622 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:57,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 13:54:57,623 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1529459068, now seen corresponding path program 1 times [2021-11-23 13:54:57,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:57,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391699976] [2021-11-23 13:54:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:57,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:57,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:57,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391699976] [2021-11-23 13:54:57,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391699976] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:57,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:57,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 13:54:57,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350869257] [2021-11-23 13:54:57,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:57,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 13:54:57,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:57,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 13:54:57,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:54:57,762 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:57,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 281 transitions, 2871 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:57,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:57,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:57,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:54:59,049 INFO L129 PetriNetUnfolder]: 1368/4292 cut-off events. [2021-11-23 13:54:59,049 INFO L130 PetriNetUnfolder]: For 39699/39987 co-relation queries the response was YES. [2021-11-23 13:54:59,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16827 conditions, 4292 events. 1368/4292 cut-off events. For 39699/39987 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 39796 event pairs, 191 based on Foata normal form. 228/4380 useless extension candidates. Maximal degree in co-relation 16510. Up to 583 conditions per place. [2021-11-23 13:54:59,090 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 163 selfloop transitions, 79 changer transitions 38/390 dead transitions. [2021-11-23 13:54:59,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 390 transitions, 4235 flow [2021-11-23 13:54:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 13:54:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-11-23 13:54:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2021-11-23 13:54:59,094 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2021-11-23 13:54:59,094 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2021-11-23 13:54:59,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2021-11-23 13:54:59,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:54:59,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2021-11-23 13:54:59,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.125) internal successors, (2146), 16 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:59,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:59,101 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:59,101 INFO L186 Difference]: Start difference. First operand has 284 places, 281 transitions, 2871 flow. Second operand 16 states and 2146 transitions. [2021-11-23 13:54:59,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 390 transitions, 4235 flow [2021-11-23 13:54:59,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 390 transitions, 4149 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-11-23 13:54:59,332 INFO L242 Difference]: Finished difference. Result has 301 places, 283 transitions, 3026 flow [2021-11-23 13:54:59,333 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3026, PETRI_PLACES=301, PETRI_TRANSITIONS=283} [2021-11-23 13:54:59,333 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2021-11-23 13:54:59,334 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 283 transitions, 3026 flow [2021-11-23 13:54:59,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:59,334 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:54:59,335 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:54:59,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 13:54:59,335 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:54:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:54:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash -255191102, now seen corresponding path program 2 times [2021-11-23 13:54:59,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:54:59,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212595591] [2021-11-23 13:54:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:54:59,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:54:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:54:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:54:59,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:54:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212595591] [2021-11-23 13:54:59,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212595591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:54:59,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:54:59,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 13:54:59,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352832972] [2021-11-23 13:54:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:54:59,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 13:54:59,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:54:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 13:54:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-23 13:54:59,479 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:54:59,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 283 transitions, 3026 flow. Second operand has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:54:59,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:54:59,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:54:59,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:00,608 INFO L129 PetriNetUnfolder]: 1282/3999 cut-off events. [2021-11-23 13:55:00,608 INFO L130 PetriNetUnfolder]: For 42560/42802 co-relation queries the response was YES. [2021-11-23 13:55:00,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 3999 events. 1282/3999 cut-off events. For 42560/42802 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 36272 event pairs, 308 based on Foata normal form. 177/4026 useless extension candidates. Maximal degree in co-relation 15892. Up to 1133 conditions per place. [2021-11-23 13:55:00,648 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 163 selfloop transitions, 73 changer transitions 17/363 dead transitions. [2021-11-23 13:55:00,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 363 transitions, 4165 flow [2021-11-23 13:55:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:55:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:55:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2021-11-23 13:55:00,651 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2021-11-23 13:55:00,651 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2021-11-23 13:55:00,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2021-11-23 13:55:00,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:00,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2021-11-23 13:55:00,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 134.83333333333334) internal successors, (1618), 12 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:00,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:00,657 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:00,657 INFO L186 Difference]: Start difference. First operand has 301 places, 283 transitions, 3026 flow. Second operand 12 states and 1618 transitions. [2021-11-23 13:55:00,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 363 transitions, 4165 flow [2021-11-23 13:55:00,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 363 transitions, 4004 flow, removed 8 selfloop flow, removed 9 redundant places. [2021-11-23 13:55:00,842 INFO L242 Difference]: Finished difference. Result has 305 places, 285 transitions, 3157 flow [2021-11-23 13:55:00,843 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2887, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3157, PETRI_PLACES=305, PETRI_TRANSITIONS=285} [2021-11-23 13:55:00,843 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 145 predicate places. [2021-11-23 13:55:00,843 INFO L470 AbstractCegarLoop]: Abstraction has has 305 places, 285 transitions, 3157 flow [2021-11-23 13:55:00,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.2) internal successors, (1252), 10 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:00,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:00,844 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:00,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 13:55:00,845 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1446565818, now seen corresponding path program 2 times [2021-11-23 13:55:00,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:00,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052093599] [2021-11-23 13:55:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:00,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:00,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-11-23 13:55:00,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052093599] [2021-11-23 13:55:00,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052093599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:00,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:00,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 13:55:00,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181472537] [2021-11-23 13:55:00,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:00,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 13:55:00,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:00,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 13:55:00,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-23 13:55:00,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2021-11-23 13:55:00,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 285 transitions, 3157 flow. Second operand has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:00,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:00,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2021-11-23 13:55:00,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:02,054 INFO L129 PetriNetUnfolder]: 1074/3669 cut-off events. [2021-11-23 13:55:02,055 INFO L130 PetriNetUnfolder]: For 43161/43397 co-relation queries the response was YES. [2021-11-23 13:55:02,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14888 conditions, 3669 events. 1074/3669 cut-off events. For 43161/43397 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 33777 event pairs, 209 based on Foata normal form. 178/3720 useless extension candidates. Maximal degree in co-relation 14606. Up to 554 conditions per place. [2021-11-23 13:55:02,093 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 146 selfloop transitions, 90 changer transitions 22/363 dead transitions. [2021-11-23 13:55:02,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 363 transitions, 4195 flow [2021-11-23 13:55:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-23 13:55:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-23 13:55:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2363 transitions. [2021-11-23 13:55:02,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173649058894961 [2021-11-23 13:55:02,098 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2363 transitions. [2021-11-23 13:55:02,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2363 transitions. [2021-11-23 13:55:02,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:02,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2363 transitions. [2021-11-23 13:55:02,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 131.27777777777777) internal successors, (2363), 18 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:02,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:02,104 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 183.0) internal successors, (3477), 19 states have internal predecessors, (3477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:02,104 INFO L186 Difference]: Start difference. First operand has 305 places, 285 transitions, 3157 flow. Second operand 18 states and 2363 transitions. [2021-11-23 13:55:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 363 transitions, 4195 flow [2021-11-23 13:55:02,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 363 transitions, 4118 flow, removed 1 selfloop flow, removed 7 redundant places. [2021-11-23 13:55:02,277 INFO L242 Difference]: Finished difference. Result has 316 places, 276 transitions, 3246 flow [2021-11-23 13:55:02,278 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=3041, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3246, PETRI_PLACES=316, PETRI_TRANSITIONS=276} [2021-11-23 13:55:02,278 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 156 predicate places. [2021-11-23 13:55:02,278 INFO L470 AbstractCegarLoop]: Abstraction has has 316 places, 276 transitions, 3246 flow [2021-11-23 13:55:02,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.0) internal successors, (1375), 11 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:02,279 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:02,279 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:02,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 13:55:02,279 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1433093063, now seen corresponding path program 1 times [2021-11-23 13:55:02,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:02,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349938716] [2021-11-23 13:55:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:02,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:02,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349938716] [2021-11-23 13:55:02,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349938716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:02,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:02,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:02,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127673737] [2021-11-23 13:55:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:02,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:02,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:02,358 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:02,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 276 transitions, 3246 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:02,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:02,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:02,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:02,978 INFO L129 PetriNetUnfolder]: 642/2507 cut-off events. [2021-11-23 13:55:02,978 INFO L130 PetriNetUnfolder]: For 28039/28164 co-relation queries the response was YES. [2021-11-23 13:55:02,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10294 conditions, 2507 events. 642/2507 cut-off events. For 28039/28164 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21338 event pairs, 106 based on Foata normal form. 62/2474 useless extension candidates. Maximal degree in co-relation 10054. Up to 351 conditions per place. [2021-11-23 13:55:03,002 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 109 selfloop transitions, 37 changer transitions 60/346 dead transitions. [2021-11-23 13:55:03,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 346 transitions, 4157 flow [2021-11-23 13:55:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 13:55:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-23 13:55:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2021-11-23 13:55:03,004 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2021-11-23 13:55:03,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2021-11-23 13:55:03,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2021-11-23 13:55:03,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:03,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2021-11-23 13:55:03,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.72727272727272) internal successors, (1625), 11 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,009 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,009 INFO L186 Difference]: Start difference. First operand has 316 places, 276 transitions, 3246 flow. Second operand 11 states and 1625 transitions. [2021-11-23 13:55:03,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 346 transitions, 4157 flow [2021-11-23 13:55:03,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 346 transitions, 3794 flow, removed 25 selfloop flow, removed 22 redundant places. [2021-11-23 13:55:03,126 INFO L242 Difference]: Finished difference. Result has 302 places, 244 transitions, 2430 flow [2021-11-23 13:55:03,126 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2430, PETRI_PLACES=302, PETRI_TRANSITIONS=244} [2021-11-23 13:55:03,127 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 142 predicate places. [2021-11-23 13:55:03,127 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 244 transitions, 2430 flow [2021-11-23 13:55:03,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:03,128 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:03,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 13:55:03,128 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1473397245, now seen corresponding path program 2 times [2021-11-23 13:55:03,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:03,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692363444] [2021-11-23 13:55:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:03,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:03,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:03,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692363444] [2021-11-23 13:55:03,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692363444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:03,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:03,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:03,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212992840] [2021-11-23 13:55:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:03,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:03,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:03,220 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:03,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 244 transitions, 2430 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:03,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:03,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:03,812 INFO L129 PetriNetUnfolder]: 591/2224 cut-off events. [2021-11-23 13:55:03,813 INFO L130 PetriNetUnfolder]: For 19537/19603 co-relation queries the response was YES. [2021-11-23 13:55:03,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8423 conditions, 2224 events. 591/2224 cut-off events. For 19537/19603 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17861 event pairs, 117 based on Foata normal form. 32/2168 useless extension candidates. Maximal degree in co-relation 8364. Up to 363 conditions per place. [2021-11-23 13:55:03,844 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 45 changer transitions 25/320 dead transitions. [2021-11-23 13:55:03,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 320 transitions, 3462 flow [2021-11-23 13:55:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:55:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:55:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2021-11-23 13:55:03,846 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2021-11-23 13:55:03,847 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2021-11-23 13:55:03,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2021-11-23 13:55:03,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:03,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2021-11-23 13:55:03,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.25) internal successors, (1767), 12 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,852 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,852 INFO L186 Difference]: Start difference. First operand has 302 places, 244 transitions, 2430 flow. Second operand 12 states and 1767 transitions. [2021-11-23 13:55:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 320 transitions, 3462 flow [2021-11-23 13:55:03,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 320 transitions, 3022 flow, removed 39 selfloop flow, removed 31 redundant places. [2021-11-23 13:55:03,912 INFO L242 Difference]: Finished difference. Result has 287 places, 255 transitions, 2348 flow [2021-11-23 13:55:03,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2348, PETRI_PLACES=287, PETRI_TRANSITIONS=255} [2021-11-23 13:55:03,913 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2021-11-23 13:55:03,913 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 255 transitions, 2348 flow [2021-11-23 13:55:03,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:03,914 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:03,914 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:03,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 13:55:03,914 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -753872925, now seen corresponding path program 3 times [2021-11-23 13:55:03,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:03,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999573867] [2021-11-23 13:55:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:03,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:04,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:04,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999573867] [2021-11-23 13:55:04,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999573867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:04,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:04,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:04,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179017591] [2021-11-23 13:55:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:04,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:04,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:04,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:04,007 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:04,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 255 transitions, 2348 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:04,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:04,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:04,505 INFO L129 PetriNetUnfolder]: 535/2012 cut-off events. [2021-11-23 13:55:04,505 INFO L130 PetriNetUnfolder]: For 13423/13512 co-relation queries the response was YES. [2021-11-23 13:55:04,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 2012 events. 535/2012 cut-off events. For 13423/13512 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 15624 event pairs, 100 based on Foata normal form. 48/1958 useless extension candidates. Maximal degree in co-relation 7131. Up to 281 conditions per place. [2021-11-23 13:55:04,523 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 105 selfloop transitions, 52 changer transitions 36/333 dead transitions. [2021-11-23 13:55:04,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 333 transitions, 3368 flow [2021-11-23 13:55:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:55:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:55:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2021-11-23 13:55:04,526 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2021-11-23 13:55:04,526 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2021-11-23 13:55:04,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2021-11-23 13:55:04,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:04,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2021-11-23 13:55:04,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.41666666666666) internal successors, (1769), 12 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,531 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,532 INFO L186 Difference]: Start difference. First operand has 287 places, 255 transitions, 2348 flow. Second operand 12 states and 1769 transitions. [2021-11-23 13:55:04,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 333 transitions, 3368 flow [2021-11-23 13:55:04,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 333 transitions, 3295 flow, removed 21 selfloop flow, removed 4 redundant places. [2021-11-23 13:55:04,579 INFO L242 Difference]: Finished difference. Result has 298 places, 261 transitions, 2511 flow [2021-11-23 13:55:04,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2511, PETRI_PLACES=298, PETRI_TRANSITIONS=261} [2021-11-23 13:55:04,580 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 138 predicate places. [2021-11-23 13:55:04,580 INFO L470 AbstractCegarLoop]: Abstraction has has 298 places, 261 transitions, 2511 flow [2021-11-23 13:55:04,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:04,581 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:04,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 13:55:04,581 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 395592405, now seen corresponding path program 4 times [2021-11-23 13:55:04,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:04,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815939884] [2021-11-23 13:55:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:04,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:04,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:04,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815939884] [2021-11-23 13:55:04,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815939884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:04,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:04,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:55:04,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284016931] [2021-11-23 13:55:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:04,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:55:04,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:55:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:55:04,625 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-11-23 13:55:04,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 261 transitions, 2511 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:04,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-11-23 13:55:04,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:04,975 INFO L129 PetriNetUnfolder]: 428/1960 cut-off events. [2021-11-23 13:55:04,975 INFO L130 PetriNetUnfolder]: For 14942/15036 co-relation queries the response was YES. [2021-11-23 13:55:04,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 1960 events. 428/1960 cut-off events. For 14942/15036 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15592 event pairs, 105 based on Foata normal form. 49/1884 useless extension candidates. Maximal degree in co-relation 6807. Up to 345 conditions per place. [2021-11-23 13:55:04,993 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 91 selfloop transitions, 10 changer transitions 8/283 dead transitions. [2021-11-23 13:55:04,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 283 transitions, 2922 flow [2021-11-23 13:55:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:55:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-11-23 13:55:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-11-23 13:55:04,994 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2021-11-23 13:55:04,994 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-11-23 13:55:04,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-11-23 13:55:04,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:04,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-11-23 13:55:04,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,996 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:04,996 INFO L186 Difference]: Start difference. First operand has 298 places, 261 transitions, 2511 flow. Second operand 4 states and 643 transitions. [2021-11-23 13:55:04,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 283 transitions, 2922 flow [2021-11-23 13:55:05,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 283 transitions, 2792 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-11-23 13:55:05,041 INFO L242 Difference]: Finished difference. Result has 295 places, 260 transitions, 2421 flow [2021-11-23 13:55:05,041 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2421, PETRI_PLACES=295, PETRI_TRANSITIONS=260} [2021-11-23 13:55:05,042 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 135 predicate places. [2021-11-23 13:55:05,042 INFO L470 AbstractCegarLoop]: Abstraction has has 295 places, 260 transitions, 2421 flow [2021-11-23 13:55:05,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,043 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:05,043 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:05,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 13:55:05,043 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 406963383, now seen corresponding path program 5 times [2021-11-23 13:55:05,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300009586] [2021-11-23 13:55:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:05,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:05,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:05,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300009586] [2021-11-23 13:55:05,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300009586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:05,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:05,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:05,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772325555] [2021-11-23 13:55:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:05,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:05,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:05,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:05,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 260 transitions, 2421 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:05,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:05,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:05,665 INFO L129 PetriNetUnfolder]: 490/2021 cut-off events. [2021-11-23 13:55:05,665 INFO L130 PetriNetUnfolder]: For 15146/15340 co-relation queries the response was YES. [2021-11-23 13:55:05,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7317 conditions, 2021 events. 490/2021 cut-off events. For 15146/15340 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 16086 event pairs, 105 based on Foata normal form. 103/2011 useless extension candidates. Maximal degree in co-relation 7261. Up to 261 conditions per place. [2021-11-23 13:55:05,682 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 100 selfloop transitions, 52 changer transitions 42/334 dead transitions. [2021-11-23 13:55:05,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 334 transitions, 3509 flow [2021-11-23 13:55:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 13:55:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-23 13:55:05,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2021-11-23 13:55:05,684 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2021-11-23 13:55:05,685 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2021-11-23 13:55:05,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2021-11-23 13:55:05,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:05,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2021-11-23 13:55:05,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.21428571428572) internal successors, (2047), 14 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,692 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 183.0) internal successors, (2745), 15 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,693 INFO L186 Difference]: Start difference. First operand has 295 places, 260 transitions, 2421 flow. Second operand 14 states and 2047 transitions. [2021-11-23 13:55:05,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 334 transitions, 3509 flow [2021-11-23 13:55:05,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 334 transitions, 3453 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-11-23 13:55:05,755 INFO L242 Difference]: Finished difference. Result has 309 places, 260 transitions, 2572 flow [2021-11-23 13:55:05,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2572, PETRI_PLACES=309, PETRI_TRANSITIONS=260} [2021-11-23 13:55:05,756 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 149 predicate places. [2021-11-23 13:55:05,756 INFO L470 AbstractCegarLoop]: Abstraction has has 309 places, 260 transitions, 2572 flow [2021-11-23 13:55:05,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,757 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:05,757 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:05,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 13:55:05,757 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1928907313, now seen corresponding path program 1 times [2021-11-23 13:55:05,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674523766] [2021-11-23 13:55:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:05,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:05,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674523766] [2021-11-23 13:55:05,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674523766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:05,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:05,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:05,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082667305] [2021-11-23 13:55:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:05,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:05,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:05,835 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:05,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 260 transitions, 2572 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:05,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:05,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:05,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:06,324 INFO L129 PetriNetUnfolder]: 413/1835 cut-off events. [2021-11-23 13:55:06,324 INFO L130 PetriNetUnfolder]: For 15681/15842 co-relation queries the response was YES. [2021-11-23 13:55:06,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 1835 events. 413/1835 cut-off events. For 15681/15842 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 14073 event pairs, 101 based on Foata normal form. 102/1840 useless extension candidates. Maximal degree in co-relation 6788. Up to 290 conditions per place. [2021-11-23 13:55:06,340 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 92 selfloop transitions, 39 changer transitions 43/300 dead transitions. [2021-11-23 13:55:06,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 300 transitions, 3243 flow [2021-11-23 13:55:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 13:55:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-23 13:55:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1598 transitions. [2021-11-23 13:55:06,342 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.793840039741679 [2021-11-23 13:55:06,342 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1598 transitions. [2021-11-23 13:55:06,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1598 transitions. [2021-11-23 13:55:06,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:06,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1598 transitions. [2021-11-23 13:55:06,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.27272727272728) internal successors, (1598), 11 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:06,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:06,352 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:06,352 INFO L186 Difference]: Start difference. First operand has 309 places, 260 transitions, 2572 flow. Second operand 11 states and 1598 transitions. [2021-11-23 13:55:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 300 transitions, 3243 flow [2021-11-23 13:55:06,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 300 transitions, 3121 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-11-23 13:55:06,421 INFO L242 Difference]: Finished difference. Result has 306 places, 229 transitions, 1954 flow [2021-11-23 13:55:06,422 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1954, PETRI_PLACES=306, PETRI_TRANSITIONS=229} [2021-11-23 13:55:06,422 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 146 predicate places. [2021-11-23 13:55:06,422 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 229 transitions, 1954 flow [2021-11-23 13:55:06,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:06,423 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:06,423 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:06,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 13:55:06,423 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1406838133, now seen corresponding path program 2 times [2021-11-23 13:55:06,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:06,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227389704] [2021-11-23 13:55:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:06,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:06,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:06,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227389704] [2021-11-23 13:55:06,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227389704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:06,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:06,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:06,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566475694] [2021-11-23 13:55:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:06,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:06,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:06,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:06,515 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:06,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 229 transitions, 1954 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:06,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:06,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:06,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:06,968 INFO L129 PetriNetUnfolder]: 283/1355 cut-off events. [2021-11-23 13:55:06,968 INFO L130 PetriNetUnfolder]: For 8800/8926 co-relation queries the response was YES. [2021-11-23 13:55:06,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1355 events. 283/1355 cut-off events. For 8800/8926 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9226 event pairs, 56 based on Foata normal form. 99/1371 useless extension candidates. Maximal degree in co-relation 4698. Up to 139 conditions per place. [2021-11-23 13:55:06,987 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 93 selfloop transitions, 43 changer transitions 27/282 dead transitions. [2021-11-23 13:55:06,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 282 transitions, 2807 flow [2021-11-23 13:55:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 13:55:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-11-23 13:55:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1608 transitions. [2021-11-23 13:55:06,990 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7988077496274217 [2021-11-23 13:55:06,990 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1608 transitions. [2021-11-23 13:55:06,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1608 transitions. [2021-11-23 13:55:06,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:06,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1608 transitions. [2021-11-23 13:55:06,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.1818181818182) internal successors, (1608), 11 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,001 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,001 INFO L186 Difference]: Start difference. First operand has 306 places, 229 transitions, 1954 flow. Second operand 11 states and 1608 transitions. [2021-11-23 13:55:07,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 282 transitions, 2807 flow [2021-11-23 13:55:07,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 282 transitions, 2439 flow, removed 9 selfloop flow, removed 36 redundant places. [2021-11-23 13:55:07,045 INFO L242 Difference]: Finished difference. Result has 280 places, 227 transitions, 1807 flow [2021-11-23 13:55:07,046 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1807, PETRI_PLACES=280, PETRI_TRANSITIONS=227} [2021-11-23 13:55:07,049 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 120 predicate places. [2021-11-23 13:55:07,049 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 227 transitions, 1807 flow [2021-11-23 13:55:07,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,049 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:07,050 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:07,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 13:55:07,050 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2083139156, now seen corresponding path program 1 times [2021-11-23 13:55:07,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329810025] [2021-11-23 13:55:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:07,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:07,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:07,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329810025] [2021-11-23 13:55:07,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329810025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:07,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:07,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:07,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304199162] [2021-11-23 13:55:07,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:07,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:07,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:07,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:07,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:07,140 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:07,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 227 transitions, 1807 flow. Second operand has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:07,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:07,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:07,407 INFO L129 PetriNetUnfolder]: 227/1086 cut-off events. [2021-11-23 13:55:07,407 INFO L130 PetriNetUnfolder]: For 5317/5436 co-relation queries the response was YES. [2021-11-23 13:55:07,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 1086 events. 227/1086 cut-off events. For 5317/5436 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6822 event pairs, 50 based on Foata normal form. 88/1087 useless extension candidates. Maximal degree in co-relation 3548. Up to 140 conditions per place. [2021-11-23 13:55:07,416 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 46 selfloop transitions, 19 changer transitions 81/252 dead transitions. [2021-11-23 13:55:07,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 252 transitions, 2302 flow [2021-11-23 13:55:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:55:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-23 13:55:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1444 transitions. [2021-11-23 13:55:07,418 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7890710382513662 [2021-11-23 13:55:07,418 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1444 transitions. [2021-11-23 13:55:07,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1444 transitions. [2021-11-23 13:55:07,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:07,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1444 transitions. [2021-11-23 13:55:07,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,424 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,424 INFO L186 Difference]: Start difference. First operand has 280 places, 227 transitions, 1807 flow. Second operand 10 states and 1444 transitions. [2021-11-23 13:55:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 252 transitions, 2302 flow [2021-11-23 13:55:07,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 252 transitions, 2188 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-11-23 13:55:07,461 INFO L242 Difference]: Finished difference. Result has 276 places, 162 transitions, 951 flow [2021-11-23 13:55:07,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=951, PETRI_PLACES=276, PETRI_TRANSITIONS=162} [2021-11-23 13:55:07,462 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 116 predicate places. [2021-11-23 13:55:07,462 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 162 transitions, 951 flow [2021-11-23 13:55:07,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.625) internal successors, (1125), 8 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:07,463 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:07,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 13:55:07,463 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -211159273, now seen corresponding path program 3 times [2021-11-23 13:55:07,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:07,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586947462] [2021-11-23 13:55:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:07,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:07,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:07,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586947462] [2021-11-23 13:55:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586947462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:07,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:07,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:07,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411764571] [2021-11-23 13:55:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:07,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:07,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:07,552 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:07,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 162 transitions, 951 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:07,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:07,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:07,794 INFO L129 PetriNetUnfolder]: 154/718 cut-off events. [2021-11-23 13:55:07,794 INFO L130 PetriNetUnfolder]: For 2856/2890 co-relation queries the response was YES. [2021-11-23 13:55:07,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 718 events. 154/718 cut-off events. For 2856/2890 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3787 event pairs, 44 based on Foata normal form. 22/684 useless extension candidates. Maximal degree in co-relation 2256. Up to 84 conditions per place. [2021-11-23 13:55:07,800 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 52 selfloop transitions, 29 changer transitions 14/201 dead transitions. [2021-11-23 13:55:07,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 201 transitions, 1494 flow [2021-11-23 13:55:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 13:55:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-23 13:55:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1726 transitions. [2021-11-23 13:55:07,802 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7859744990892532 [2021-11-23 13:55:07,802 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1726 transitions. [2021-11-23 13:55:07,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1726 transitions. [2021-11-23 13:55:07,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:07,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1726 transitions. [2021-11-23 13:55:07,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 143.83333333333334) internal successors, (1726), 12 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,806 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,806 INFO L186 Difference]: Start difference. First operand has 276 places, 162 transitions, 951 flow. Second operand 12 states and 1726 transitions. [2021-11-23 13:55:07,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 201 transitions, 1494 flow [2021-11-23 13:55:07,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 201 transitions, 1106 flow, removed 18 selfloop flow, removed 58 redundant places. [2021-11-23 13:55:07,818 INFO L242 Difference]: Finished difference. Result has 207 places, 170 transitions, 833 flow [2021-11-23 13:55:07,819 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=833, PETRI_PLACES=207, PETRI_TRANSITIONS=170} [2021-11-23 13:55:07,819 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2021-11-23 13:55:07,819 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 170 transitions, 833 flow [2021-11-23 13:55:07,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:07,820 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:07,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-23 13:55:07,820 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1004025607, now seen corresponding path program 4 times [2021-11-23 13:55:07,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:07,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265949163] [2021-11-23 13:55:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:07,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:07,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:07,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265949163] [2021-11-23 13:55:07,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265949163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:07,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:07,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:55:07,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633895885] [2021-11-23 13:55:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:07,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:55:07,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:07,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:55:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:55:07,862 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2021-11-23 13:55:07,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 170 transitions, 833 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:07,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:07,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2021-11-23 13:55:07,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:08,003 INFO L129 PetriNetUnfolder]: 135/731 cut-off events. [2021-11-23 13:55:08,003 INFO L130 PetriNetUnfolder]: For 1890/1928 co-relation queries the response was YES. [2021-11-23 13:55:08,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 731 events. 135/731 cut-off events. For 1890/1928 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3894 event pairs, 49 based on Foata normal form. 21/695 useless extension candidates. Maximal degree in co-relation 1900. Up to 100 conditions per place. [2021-11-23 13:55:08,008 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 50 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2021-11-23 13:55:08,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 184 transitions, 1056 flow [2021-11-23 13:55:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:55:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-11-23 13:55:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2021-11-23 13:55:08,010 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8688524590163934 [2021-11-23 13:55:08,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2021-11-23 13:55:08,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2021-11-23 13:55:08,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:08,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2021-11-23 13:55:08,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,013 INFO L186 Difference]: Start difference. First operand has 207 places, 170 transitions, 833 flow. Second operand 4 states and 636 transitions. [2021-11-23 13:55:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 184 transitions, 1056 flow [2021-11-23 13:55:08,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 184 transitions, 972 flow, removed 12 selfloop flow, removed 9 redundant places. [2021-11-23 13:55:08,021 INFO L242 Difference]: Finished difference. Result has 203 places, 171 transitions, 806 flow [2021-11-23 13:55:08,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=806, PETRI_PLACES=203, PETRI_TRANSITIONS=171} [2021-11-23 13:55:08,022 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2021-11-23 13:55:08,022 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 171 transitions, 806 flow [2021-11-23 13:55:08,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:08,023 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:08,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 13:55:08,023 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1938821721, now seen corresponding path program 5 times [2021-11-23 13:55:08,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:08,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95974076] [2021-11-23 13:55:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:08,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:08,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:08,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95974076] [2021-11-23 13:55:08,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95974076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:08,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:08,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:08,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36948936] [2021-11-23 13:55:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:08,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:08,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:08,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:08,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:08,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:08,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 171 transitions, 806 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:08,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:08,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:08,352 INFO L129 PetriNetUnfolder]: 161/794 cut-off events. [2021-11-23 13:55:08,353 INFO L130 PetriNetUnfolder]: For 2567/2672 co-relation queries the response was YES. [2021-11-23 13:55:08,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 794 events. 161/794 cut-off events. For 2567/2672 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4420 event pairs, 47 based on Foata normal form. 72/807 useless extension candidates. Maximal degree in co-relation 2132. Up to 84 conditions per place. [2021-11-23 13:55:08,357 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 29 changer transitions 25/206 dead transitions. [2021-11-23 13:55:08,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 206 transitions, 1292 flow [2021-11-23 13:55:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 13:55:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-23 13:55:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1863 transitions. [2021-11-23 13:55:08,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7831021437578815 [2021-11-23 13:55:08,360 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1863 transitions. [2021-11-23 13:55:08,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1863 transitions. [2021-11-23 13:55:08,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:08,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1863 transitions. [2021-11-23 13:55:08,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.30769230769232) internal successors, (1863), 13 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,363 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 183.0) internal successors, (2562), 14 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,363 INFO L186 Difference]: Start difference. First operand has 203 places, 171 transitions, 806 flow. Second operand 13 states and 1863 transitions. [2021-11-23 13:55:08,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 206 transitions, 1292 flow [2021-11-23 13:55:08,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 1247 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-11-23 13:55:08,372 INFO L242 Difference]: Finished difference. Result has 214 places, 169 transitions, 873 flow [2021-11-23 13:55:08,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=873, PETRI_PLACES=214, PETRI_TRANSITIONS=169} [2021-11-23 13:55:08,374 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 54 predicate places. [2021-11-23 13:55:08,374 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 169 transitions, 873 flow [2021-11-23 13:55:08,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-23 13:55:08,375 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:08,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-23 13:55:08,375 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-23 13:55:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:55:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1815609525, now seen corresponding path program 1 times [2021-11-23 13:55:08,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:55:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57889802] [2021-11-23 13:55:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:55:08,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:55:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:55:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:55:08,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:55:08,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57889802] [2021-11-23 13:55:08,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57889802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:55:08,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:55:08,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 13:55:08,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968458935] [2021-11-23 13:55:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:55:08,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 13:55:08,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:55:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 13:55:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-23 13:55:08,484 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-11-23 13:55:08,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 169 transitions, 873 flow. Second operand has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-23 13:55:08,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-11-23 13:55:08,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-23 13:55:08,622 INFO L129 PetriNetUnfolder]: 107/547 cut-off events. [2021-11-23 13:55:08,622 INFO L130 PetriNetUnfolder]: For 2026/2121 co-relation queries the response was YES. [2021-11-23 13:55:08,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 547 events. 107/547 cut-off events. For 2026/2121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2347 event pairs, 24 based on Foata normal form. 72/567 useless extension candidates. Maximal degree in co-relation 1495. Up to 79 conditions per place. [2021-11-23 13:55:08,625 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2021-11-23 13:55:08,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 183 transitions, 1140 flow [2021-11-23 13:55:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 13:55:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-23 13:55:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2021-11-23 13:55:08,627 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7795992714025501 [2021-11-23 13:55:08,627 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1284 transitions. [2021-11-23 13:55:08,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1284 transitions. [2021-11-23 13:55:08,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-23 13:55:08,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1284 transitions. [2021-11-23 13:55:08,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.66666666666666) internal successors, (1284), 9 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,632 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,632 INFO L186 Difference]: Start difference. First operand has 214 places, 169 transitions, 873 flow. Second operand 9 states and 1284 transitions. [2021-11-23 13:55:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 183 transitions, 1140 flow [2021-11-23 13:55:08,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 183 transitions, 1060 flow, removed 10 selfloop flow, removed 11 redundant places. [2021-11-23 13:55:08,642 INFO L242 Difference]: Finished difference. Result has 207 places, 0 transitions, 0 flow [2021-11-23 13:55:08,642 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=207, PETRI_TRANSITIONS=0} [2021-11-23 13:55:08,643 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2021-11-23 13:55:08,643 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 0 transitions, 0 flow [2021-11-23 13:55:08,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:55:08,646 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-23 13:55:08,647 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-23 13:55:08,648 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-11-23 13:55:08,648 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-11-23 13:55:08,648 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-11-23 13:55:08,648 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-23 13:55:08,648 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-23 13:55:08,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-23 13:55:08,653 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:55:08,658 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-23 13:55:08,658 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:55:08,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:55:08 BasicIcfg [2021-11-23 13:55:08,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:55:08,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:55:08,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:55:08,662 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:55:08,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:29" (3/4) ... [2021-11-23 13:55:08,665 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 13:55:08,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2021-11-23 13:55:08,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2021-11-23 13:55:08,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2021-11-23 13:55:08,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-11-23 13:55:08,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-23 13:55:08,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-23 13:55:08,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 13:55:08,706 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:55:08,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:55:08,707 INFO L158 Benchmark]: Toolchain (without parser) took 40485.13ms. Allocated memory was 104.9MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 71.2MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-23 13:55:08,707 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:55:08,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.52ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 71.0MB in the beginning and 103.0MB in the end (delta: -32.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-11-23 13:55:08,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.41ms. Allocated memory is still 127.9MB. Free memory was 102.9MB in the beginning and 102.6MB in the end (delta: 350.7kB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-11-23 13:55:08,708 INFO L158 Benchmark]: Boogie Preprocessor took 78.99ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:55:08,709 INFO L158 Benchmark]: RCFGBuilder took 859.49ms. Allocated memory is still 127.9MB. Free memory was 100.5MB in the beginning and 69.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-11-23 13:55:08,709 INFO L158 Benchmark]: TraceAbstraction took 38750.50ms. Allocated memory was 127.9MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 68.5MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-23 13:55:08,710 INFO L158 Benchmark]: Witness Printer took 44.51ms. Allocated memory is still 4.1GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:55:08,712 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.13ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.52ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 71.0MB in the beginning and 103.0MB in the end (delta: -32.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.41ms. Allocated memory is still 127.9MB. Free memory was 102.9MB in the beginning and 102.6MB in the end (delta: 350.7kB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.99ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.49ms. Allocated memory is still 127.9MB. Free memory was 100.5MB in the beginning and 69.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38750.50ms. Allocated memory was 127.9MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 68.5MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 44.51ms. Allocated memory is still 4.1GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 712]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 719]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.4s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2700 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2700 mSDsluCounter, 1726 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3138 mSDsCounter, 617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8441 IncrementalHoareTripleChecker+Invalid, 9058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 617 mSolverCounterUnsat, 567 mSDtfsCounter, 8441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3246occurred in iteration=22, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2861 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2827 ConstructedInterpolants, 0 QuantifiedInterpolants, 14178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-23 13:55:08,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda41488-12f9-4dd4-8121-c0953b719c7b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE