/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 10:24:20,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:24:20,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:24:20,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:24:20,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:24:20,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:24:20,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:24:20,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:24:20,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:24:20,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:24:20,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:24:20,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:24:20,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:24:20,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:24:20,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:24:20,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:24:20,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:24:20,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:24:20,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:24:20,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:24:20,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:24:20,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:24:20,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:24:20,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:24:20,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:24:20,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:24:20,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:24:20,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:24:20,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:24:20,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:24:20,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:24:20,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:24:20,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:24:20,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:24:20,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:24:20,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:24:20,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:24:20,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:24:20,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:24:20,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:24:20,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:24:20,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 10:24:20,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:24:20,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:24:20,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:24:20,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:24:20,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:24:20,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:24:20,902 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:24:20,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:24:20,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:24:20,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:24:20,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:24:20,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:24:20,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:24:20,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:24:20,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:24:20,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:24:20,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:24:20,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:24:20,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:24:20,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:24:20,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 10:24:21,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:24:21,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:24:21,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:24:21,096 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:24:21,098 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:24:21,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2022-01-19 10:24:21,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4139c059c/fdec9f523a8d4dd8b3c21aade0b00468/FLAG0ef2e4580 [2022-01-19 10:24:21,520 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:24:21,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i [2022-01-19 10:24:21,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4139c059c/fdec9f523a8d4dd8b3c21aade0b00468/FLAG0ef2e4580 [2022-01-19 10:24:21,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4139c059c/fdec9f523a8d4dd8b3c21aade0b00468 [2022-01-19 10:24:21,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:24:21,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:24:21,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:24:21,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:24:21,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:24:21,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:24:21" (1/1) ... [2022-01-19 10:24:21,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa44b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:21, skipping insertion in model container [2022-01-19 10:24:21,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:24:21" (1/1) ... [2022-01-19 10:24:21,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:24:21,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:24:22,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2022-01-19 10:24:22,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2022-01-19 10:24:22,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:24:22,237 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:24:22,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30694,30707] [2022-01-19 10:24:22,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/qrcu-1.i[30916,30929] [2022-01-19 10:24:22,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:24:22,324 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:24:22,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22 WrapperNode [2022-01-19 10:24:22,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:24:22,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:24:22,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:24:22,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:24:22,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,389 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2022-01-19 10:24:22,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:24:22,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:24:22,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:24:22,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:24:22,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:24:22,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:24:22,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:24:22,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:24:22,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (1/1) ... [2022-01-19 10:24:22,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:24:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:24:22,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 10:24:22,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 10:24:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-01-19 10:24:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-01-19 10:24:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-01-19 10:24:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-01-19 10:24:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 10:24:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:24:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-01-19 10:24:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:24:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:24:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:24:22,527 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 10:24:22,668 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:24:22,677 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:24:22,893 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:24:23,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:24:23,084 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 10:24:23,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:24:23 BoogieIcfgContainer [2022-01-19 10:24:23,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:24:23,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:24:23,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:24:23,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:24:23,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:24:21" (1/3) ... [2022-01-19 10:24:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b591319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:24:23, skipping insertion in model container [2022-01-19 10:24:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:24:22" (2/3) ... [2022-01-19 10:24:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b591319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:24:23, skipping insertion in model container [2022-01-19 10:24:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:24:23" (3/3) ... [2022-01-19 10:24:23,091 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2022-01-19 10:24:23,094 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:24:23,094 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 10:24:23,094 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:24:23,147 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,148 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,149 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,150 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,151 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,152 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,153 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,154 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,155 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,156 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,157 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,158 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,159 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,161 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,162 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,163 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,165 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,166 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,167 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,168 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,169 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,170 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,171 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,175 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,179 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,180 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,181 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,182 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,183 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,184 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,185 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,186 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,187 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,190 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,191 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,192 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,193 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 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. [2022-01-19 10:24:23,194 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. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,194 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. [2022-01-19 10:24:23,194 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. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,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. [2022-01-19 10:24:23,195 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. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,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. [2022-01-19 10:24:23,195 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. [2022-01-19 10:24:23,195 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. [2022-01-19 10:24:23,195 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,196 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,197 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,198 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,199 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,199 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,199 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,200 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,202 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,203 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,204 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,205 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,212 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,212 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,212 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,212 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,213 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,214 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,215 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,216 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,216 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,216 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,216 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,217 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,218 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,219 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,220 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,223 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,224 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,225 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,226 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,227 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,228 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,229 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,229 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,229 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,233 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,233 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,233 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,233 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 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. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,234 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~sum~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,235 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. [2022-01-19 10:24:23,235 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~post19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress2_#in~readerstart2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 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. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart2#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,236 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~nondet13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,237 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,237 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,237 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,237 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. [2022-01-19 10:24:23,237 WARN L322 ript$VariableManager]: TermVariabe |qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_take_snapshot_~readerstart1#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~myidx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,238 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader1Thread1of1ForFork1___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,239 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use2_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,240 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_#in~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~myidx~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use_done_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,241 WARN L322 ript$VariableManager]: TermVariabe |qrcu_reader2Thread1of1ForFork2___VERIFIER_atomic_use1_~myidx#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:24:23,245 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 10:24:23,280 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:24:23,284 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=false, 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 [2022-01-19 10:24:23,284 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 10:24:23,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-01-19 10:24:23,331 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2022-01-19 10:24:23,331 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 10:24:23,334 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. [2022-01-19 10:24:23,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-01-19 10:24:23,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2022-01-19 10:24:23,356 INFO L129 PetriNetUnfolder]: 9/124 cut-off events. [2022-01-19 10:24:23,356 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 10:24:23,356 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:23,356 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] [2022-01-19 10:24:23,357 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2022-01-19 10:24:23,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:23,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116947739] [2022-01-19 10:24:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:23,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:23,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:23,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116947739] [2022-01-19 10:24:23,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116947739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:23,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:23,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:24:23,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885384814] [2022-01-19 10:24:23,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:23,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:23,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:23,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2022-01-19 10:24:23,614 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) [2022-01-19 10:24:23,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:23,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2022-01-19 10:24:23,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:23,908 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2022-01-19 10:24:23,909 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-01-19 10:24:23,917 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. [2022-01-19 10:24:23,926 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-01-19 10:24:23,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2022-01-19 10:24:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-01-19 10:24:23,940 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2022-01-19 10:24:23,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-01-19 10:24:23,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-01-19 10:24:23,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:23,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-01-19 10:24:23,948 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) [2022-01-19 10:24:23,953 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) [2022-01-19 10:24:23,953 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) [2022-01-19 10:24:23,954 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2022-01-19 10:24:23,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2022-01-19 10:24:23,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 10:24:23,965 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2022-01-19 10:24:23,967 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} [2022-01-19 10:24:23,969 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2022-01-19 10:24:23,969 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2022-01-19 10:24:23,969 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) [2022-01-19 10:24:23,970 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:23,970 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] [2022-01-19 10:24:23,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:24:23,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:23,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2022-01-19 10:24:23,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:23,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662701502] [2022-01-19 10:24:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:23,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:24,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:24,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662701502] [2022-01-19 10:24:24,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662701502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:24,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:24,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 10:24:24,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222610048] [2022-01-19 10:24:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:24,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:24,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:24,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-01-19 10:24:24,122 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) [2022-01-19 10:24:24,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:24,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-01-19 10:24:24,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:24,264 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2022-01-19 10:24:24,264 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-01-19 10:24:24,268 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. [2022-01-19 10:24:24,273 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-01-19 10:24:24,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2022-01-19 10:24:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-01-19 10:24:24,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-01-19 10:24:24,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:24,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,276 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) [2022-01-19 10:24:24,277 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) [2022-01-19 10:24:24,278 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) [2022-01-19 10:24:24,278 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2022-01-19 10:24:24,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2022-01-19 10:24:24,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:24:24,284 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2022-01-19 10:24:24,284 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} [2022-01-19 10:24:24,284 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2022-01-19 10:24:24,285 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2022-01-19 10:24:24,285 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) [2022-01-19 10:24:24,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:24,286 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] [2022-01-19 10:24:24,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:24:24,286 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2022-01-19 10:24:24,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:24,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203931576] [2022-01-19 10:24:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:24,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:24,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:24,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203931576] [2022-01-19 10:24:24,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203931576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:24,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:24,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 10:24:24,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67018321] [2022-01-19 10:24:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:24,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:24,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:24,382 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-01-19 10:24:24,382 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) [2022-01-19 10:24:24,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:24,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-01-19 10:24:24,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:24,536 INFO L129 PetriNetUnfolder]: 399/1248 cut-off events. [2022-01-19 10:24:24,536 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-01-19 10:24:24,539 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. [2022-01-19 10:24:24,543 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-01-19 10:24:24,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 172 transitions, 429 flow [2022-01-19 10:24:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:24,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-01-19 10:24:24,544 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-01-19 10:24:24,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:24,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-01-19 10:24:24,545 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) [2022-01-19 10:24:24,546 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) [2022-01-19 10:24:24,546 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) [2022-01-19 10:24:24,546 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 3 states and 500 transitions. [2022-01-19 10:24:24,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 172 transitions, 429 flow [2022-01-19 10:24:24,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 172 transitions, 425 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 10:24:24,550 INFO L242 Difference]: Finished difference. Result has 162 places, 163 transitions, 354 flow [2022-01-19 10:24:24,550 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} [2022-01-19 10:24:24,552 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2022-01-19 10:24:24,552 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 163 transitions, 354 flow [2022-01-19 10:24:24,552 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) [2022-01-19 10:24:24,552 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:24,552 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] [2022-01-19 10:24:24,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:24:24,553 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash -671928539, now seen corresponding path program 1 times [2022-01-19 10:24:24,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:24,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982080835] [2022-01-19 10:24:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:24,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:24,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982080835] [2022-01-19 10:24:24,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982080835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:24,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:24,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:24:24,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398226873] [2022-01-19 10:24:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:24,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:24:24,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:24,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:24:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:24:24,672 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-01-19 10:24:24,673 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) [2022-01-19 10:24:24,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:24,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-01-19 10:24:24,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:24,946 INFO L129 PetriNetUnfolder]: 779/1959 cut-off events. [2022-01-19 10:24:24,946 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-01-19 10:24:24,951 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. [2022-01-19 10:24:24,957 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 93 selfloop transitions, 31 changer transitions 0/243 dead transitions. [2022-01-19 10:24:24,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 243 transitions, 798 flow [2022-01-19 10:24:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 10:24:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 10:24:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2022-01-19 10:24:24,959 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2022-01-19 10:24:24,960 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2022-01-19 10:24:24,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2022-01-19 10:24:24,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:24,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2022-01-19 10:24:24,962 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) [2022-01-19 10:24:24,964 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) [2022-01-19 10:24:24,964 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) [2022-01-19 10:24:24,964 INFO L186 Difference]: Start difference. First operand has 162 places, 163 transitions, 354 flow. Second operand 8 states and 1198 transitions. [2022-01-19 10:24:24,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 243 transitions, 798 flow [2022-01-19 10:24:24,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 243 transitions, 794 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 10:24:24,968 INFO L242 Difference]: Finished difference. Result has 173 places, 196 transitions, 597 flow [2022-01-19 10:24:24,968 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} [2022-01-19 10:24:24,969 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 13 predicate places. [2022-01-19 10:24:24,969 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 597 flow [2022-01-19 10:24:24,969 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) [2022-01-19 10:24:24,970 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:24,970 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] [2022-01-19 10:24:24,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 10:24:24,970 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 911682777, now seen corresponding path program 2 times [2022-01-19 10:24:24,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:24,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146246783] [2022-01-19 10:24:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:24,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:25,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:25,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146246783] [2022-01-19 10:24:25,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146246783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:25,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:25,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:24:25,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717581799] [2022-01-19 10:24:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:25,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:24:25,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:24:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:24:25,044 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2022-01-19 10:24:25,045 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) [2022-01-19 10:24:25,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:25,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2022-01-19 10:24:25,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:25,587 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 186#(= ~readerprogress1~0 0)]) [2022-01-19 10:24:25,587 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-01-19 10:24:25,587 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-01-19 10:24:25,587 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-01-19 10:24:25,587 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-01-19 10:24:25,607 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2022-01-19 10:24:25,607 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2022-01-19 10:24:25,607 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-01-19 10:24:25,607 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-01-19 10:24:25,607 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-01-19 10:24:25,643 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 186#(= ~readerprogress1~0 0)]) [2022-01-19 10:24:25,643 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2022-01-19 10:24:25,643 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-01-19 10:24:25,643 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is not cut-off event [2022-01-19 10:24:25,643 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2022-01-19 10:24:25,660 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 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) (= (+ (- 1) ~ctr1~0) 0)), 194#true, Black: 178#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 22#L739true, Black: 186#(= ~readerprogress1~0 0)]) [2022-01-19 10:24:25,660 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is not cut-off event [2022-01-19 10:24:25,660 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2022-01-19 10:24:25,660 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is not cut-off event [2022-01-19 10:24:25,660 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2022-01-19 10:24:25,775 INFO L129 PetriNetUnfolder]: 3694/7612 cut-off events. [2022-01-19 10:24:25,775 INFO L130 PetriNetUnfolder]: For 8648/8824 co-relation queries the response was YES. [2022-01-19 10:24:25,805 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. [2022-01-19 10:24:25,930 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 172 selfloop transitions, 17 changer transitions 2/319 dead transitions. [2022-01-19 10:24:25,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 319 transitions, 1521 flow [2022-01-19 10:24:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 10:24:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 10:24:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2022-01-19 10:24:25,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2022-01-19 10:24:25,933 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2022-01-19 10:24:25,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2022-01-19 10:24:25,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:25,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2022-01-19 10:24:25,935 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) [2022-01-19 10:24:25,937 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) [2022-01-19 10:24:25,938 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) [2022-01-19 10:24:25,938 INFO L186 Difference]: Start difference. First operand has 173 places, 196 transitions, 597 flow. Second operand 10 states and 1381 transitions. [2022-01-19 10:24:25,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 319 transitions, 1521 flow [2022-01-19 10:24:25,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 319 transitions, 1521 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 10:24:25,956 INFO L242 Difference]: Finished difference. Result has 187 places, 211 transitions, 700 flow [2022-01-19 10:24:25,957 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} [2022-01-19 10:24:25,957 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 27 predicate places. [2022-01-19 10:24:25,957 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 211 transitions, 700 flow [2022-01-19 10:24:25,958 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) [2022-01-19 10:24:25,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:25,958 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] [2022-01-19 10:24:25,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:24:25,958 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1278935995, now seen corresponding path program 1 times [2022-01-19 10:24:25,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387540421] [2022-01-19 10:24:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:25,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:26,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:26,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387540421] [2022-01-19 10:24:26,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387540421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:26,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:26,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 10:24:26,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086839030] [2022-01-19 10:24:26,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:26,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:24:26,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:26,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:24:26,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:24:26,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-01-19 10:24:26,020 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) [2022-01-19 10:24:26,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:26,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-01-19 10:24:26,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:26,646 INFO L129 PetriNetUnfolder]: 1355/3313 cut-off events. [2022-01-19 10:24:26,646 INFO L130 PetriNetUnfolder]: For 4044/4077 co-relation queries the response was YES. [2022-01-19 10:24:26,657 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. [2022-01-19 10:24:26,669 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 118 selfloop transitions, 37 changer transitions 0/288 dead transitions. [2022-01-19 10:24:26,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 288 transitions, 1330 flow [2022-01-19 10:24:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 10:24:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 10:24:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2022-01-19 10:24:26,672 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027322404371585 [2022-01-19 10:24:26,672 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1469 transitions. [2022-01-19 10:24:26,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1469 transitions. [2022-01-19 10:24:26,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:26,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1469 transitions. [2022-01-19 10:24:26,675 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) [2022-01-19 10:24:26,677 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) [2022-01-19 10:24:26,677 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) [2022-01-19 10:24:26,677 INFO L186 Difference]: Start difference. First operand has 187 places, 211 transitions, 700 flow. Second operand 10 states and 1469 transitions. [2022-01-19 10:24:26,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 288 transitions, 1330 flow [2022-01-19 10:24:26,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 288 transitions, 1330 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 10:24:26,689 INFO L242 Difference]: Finished difference. Result has 201 places, 227 transitions, 939 flow [2022-01-19 10:24:26,690 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} [2022-01-19 10:24:26,690 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2022-01-19 10:24:26,690 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 227 transitions, 939 flow [2022-01-19 10:24:26,690 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) [2022-01-19 10:24:26,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:26,691 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] [2022-01-19 10:24:26,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:24:26,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash -943571459, now seen corresponding path program 1 times [2022-01-19 10:24:26,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:26,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246600909] [2022-01-19 10:24:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:26,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:26,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246600909] [2022-01-19 10:24:26,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246600909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:26,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:26,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 10:24:26,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624542153] [2022-01-19 10:24:26,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:26,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:26,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:26,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:26,720 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-01-19 10:24:26,720 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) [2022-01-19 10:24:26,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:26,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-01-19 10:24:26,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:27,041 INFO L129 PetriNetUnfolder]: 952/2875 cut-off events. [2022-01-19 10:24:27,042 INFO L130 PetriNetUnfolder]: For 4069/4222 co-relation queries the response was YES. [2022-01-19 10:24:27,054 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. [2022-01-19 10:24:27,062 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2022-01-19 10:24:27,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 247 transitions, 1198 flow [2022-01-19 10:24:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-01-19 10:24:27,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-01-19 10:24:27,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-01-19 10:24:27,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-01-19 10:24:27,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:27,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-01-19 10:24:27,065 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) [2022-01-19 10:24:27,066 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) [2022-01-19 10:24:27,066 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) [2022-01-19 10:24:27,066 INFO L186 Difference]: Start difference. First operand has 201 places, 227 transitions, 939 flow. Second operand 3 states and 500 transitions. [2022-01-19 10:24:27,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 247 transitions, 1198 flow [2022-01-19 10:24:27,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 247 transitions, 1175 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 10:24:27,074 INFO L242 Difference]: Finished difference. Result has 200 places, 227 transitions, 923 flow [2022-01-19 10:24:27,075 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} [2022-01-19 10:24:27,075 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 40 predicate places. [2022-01-19 10:24:27,075 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 227 transitions, 923 flow [2022-01-19 10:24:27,075 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) [2022-01-19 10:24:27,076 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:27,076 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] [2022-01-19 10:24:27,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 10:24:27,076 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 569723890, now seen corresponding path program 1 times [2022-01-19 10:24:27,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588463868] [2022-01-19 10:24:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:27,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:27,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:27,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588463868] [2022-01-19 10:24:27,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588463868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:27,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:27,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:24:27,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830992520] [2022-01-19 10:24:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:27,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 10:24:27,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:27,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 10:24:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 10:24:27,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:27,119 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) [2022-01-19 10:24:27,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:27,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:27,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:27,720 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,720 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,720 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,720 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,721 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,721 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,721 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,721 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,721 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 10:24:27,830 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,830 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,830 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,830 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,830 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,830 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,831 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,831 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) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,831 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,831 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,832 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,832 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:27,832 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) 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) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:27,832 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:27,912 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:27,913 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-01-19 10:24:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 10:24:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 10:24:27,913 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 10:24:28,049 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,050 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 10:24:28,050 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,050 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 10:24:28,050 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 10:24:28,050 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,051 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 10:24:28,051 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,051 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 10:24:28,051 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 10:24:28,160 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,160 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 10:24:28,160 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 10:24:28,160 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:28,161 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:28,191 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,191 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 10:24:28,191 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 10:24:28,191 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 10:24:28,191 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 10:24:28,228 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 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#(= (+ (- 1) ~ctr1~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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,228 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,228 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,228 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 10:24:28,228 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 10:24:28,229 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), Black: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,229 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,229 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 10:24:28,229 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 10:24:28,229 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 10:24:28,267 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L769-1-->L777: Formula: (= (select (select |v_#memory_int_1| |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base_5|) |v_qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset_5|) |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_1|) 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) (= (+ (- 1) ~ctr1~0) 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#(= (+ (- 1) ~ctr1~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: 203#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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))]) [2022-01-19 10:24:28,267 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 10:24:28,267 INFO L387 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-01-19 10:24:28,267 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:28,268 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 10:24:28,602 INFO L129 PetriNetUnfolder]: 5267/11896 cut-off events. [2022-01-19 10:24:28,602 INFO L130 PetriNetUnfolder]: For 14159/14513 co-relation queries the response was YES. [2022-01-19 10:24:28,667 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. [2022-01-19 10:24:28,700 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 159 selfloop transitions, 12 changer transitions 6/336 dead transitions. [2022-01-19 10:24:28,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 1840 flow [2022-01-19 10:24:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 10:24:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 10:24:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1069 transitions. [2022-01-19 10:24:28,702 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.834504293520687 [2022-01-19 10:24:28,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1069 transitions. [2022-01-19 10:24:28,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1069 transitions. [2022-01-19 10:24:28,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:28,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1069 transitions. [2022-01-19 10:24:28,705 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) [2022-01-19 10:24:28,706 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) [2022-01-19 10:24:28,707 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) [2022-01-19 10:24:28,707 INFO L186 Difference]: Start difference. First operand has 200 places, 227 transitions, 923 flow. Second operand 7 states and 1069 transitions. [2022-01-19 10:24:28,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 1840 flow [2022-01-19 10:24:28,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 336 transitions, 1839 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:24:28,756 INFO L242 Difference]: Finished difference. Result has 207 places, 237 transitions, 994 flow [2022-01-19 10:24:28,756 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} [2022-01-19 10:24:28,756 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2022-01-19 10:24:28,756 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 237 transitions, 994 flow [2022-01-19 10:24:28,757 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) [2022-01-19 10:24:28,757 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:28,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] [2022-01-19 10:24:28,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 10:24:28,757 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1129125278, now seen corresponding path program 1 times [2022-01-19 10:24:28,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818812383] [2022-01-19 10:24:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:28,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:28,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818812383] [2022-01-19 10:24:28,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818812383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:28,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:28,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 10:24:28,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741015222] [2022-01-19 10:24:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:28,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:28,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:28,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:28,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:28,791 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-01-19 10:24:28,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 237 transitions, 994 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:28,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:28,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-01-19 10:24:28,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:29,248 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][217], [Black: 191#(= ~readerprogress2~0 0), Black: 257#(= ~readerprogress1~0 2), 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) (= (+ (- 1) ~ctr1~0) 0)), Black: 199#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 198#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 196#(= (+ (- 1) ~ctr1~0) 0), 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 128#L777-3true, 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, 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))]) [2022-01-19 10:24:29,249 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,249 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 10:24:29,249 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,249 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:29,301 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][212], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 166#L771-3true, 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), 211#true, 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) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:29,301 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 10:24:29,301 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,301 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,301 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:29,301 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([851] L772-1-->L772-2: Formula: (= (+ |v_qrcu_updaterThread1of1ForFork0_#t~post18#1_3| 1) v_~ctr1~0_20) 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][213], [Black: 191#(= ~readerprogress2~0 0), 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 276#(= ~readerprogress2~0 2), 109#L787-2true, Black: 201#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 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#(= (+ (- 1) ~ctr1~0) 0), 211#true, 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)), 51#L772-2true, Black: 197#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 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]) [2022-01-19 10:24:29,301 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 10:24:29,302 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,302 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 10:24:29,302 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:29,379 INFO L129 PetriNetUnfolder]: 1519/4732 cut-off events. [2022-01-19 10:24:29,380 INFO L130 PetriNetUnfolder]: For 5293/5550 co-relation queries the response was YES. [2022-01-19 10:24:29,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 4732 events. 1519/4732 cut-off events. For 5293/5550 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 45269 event pairs, 202 based on Foata normal form. 107/4467 useless extension candidates. Maximal degree in co-relation 10451. Up to 1145 conditions per place. [2022-01-19 10:24:29,416 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-01-19 10:24:29,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 258 transitions, 1265 flow [2022-01-19 10:24:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-01-19 10:24:29,417 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-01-19 10:24:29,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-01-19 10:24:29,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-01-19 10:24:29,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:29,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-01-19 10:24:29,419 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) [2022-01-19 10:24:29,420 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) [2022-01-19 10:24:29,420 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) [2022-01-19 10:24:29,420 INFO L186 Difference]: Start difference. First operand has 207 places, 237 transitions, 994 flow. Second operand 3 states and 500 transitions. [2022-01-19 10:24:29,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 258 transitions, 1265 flow [2022-01-19 10:24:29,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 258 transitions, 1265 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 10:24:29,435 INFO L242 Difference]: Finished difference. Result has 210 places, 237 transitions, 999 flow [2022-01-19 10:24:29,435 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=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=999, PETRI_PLACES=210, PETRI_TRANSITIONS=237} [2022-01-19 10:24:29,436 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2022-01-19 10:24:29,436 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 237 transitions, 999 flow [2022-01-19 10:24:29,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:29,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:29,436 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] [2022-01-19 10:24:29,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 10:24:29,437 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1045246048, now seen corresponding path program 1 times [2022-01-19 10:24:29,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:29,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229965715] [2022-01-19 10:24:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:29,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:29,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:29,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229965715] [2022-01-19 10:24:29,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229965715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:29,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:29,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:24:29,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033044314] [2022-01-19 10:24:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:29,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:29,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:29,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-01-19 10:24:29,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 237 transitions, 999 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) [2022-01-19 10:24:29,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:29,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-01-19 10:24:29,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:30,305 INFO L129 PetriNetUnfolder]: 2551/7930 cut-off events. [2022-01-19 10:24:30,305 INFO L130 PetriNetUnfolder]: For 8245/8454 co-relation queries the response was YES. [2022-01-19 10:24:30,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17394 conditions, 7930 events. 2551/7930 cut-off events. For 8245/8454 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 80999 event pairs, 606 based on Foata normal form. 35/7288 useless extension candidates. Maximal degree in co-relation 17006. Up to 2534 conditions per place. [2022-01-19 10:24:30,341 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 59 selfloop transitions, 1 changer transitions 44/256 dead transitions. [2022-01-19 10:24:30,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 256 transitions, 1245 flow [2022-01-19 10:24:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-01-19 10:24:30,343 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2022-01-19 10:24:30,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-01-19 10:24:30,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-01-19 10:24:30,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:30,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-01-19 10:24:30,344 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) [2022-01-19 10:24:30,345 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) [2022-01-19 10:24:30,345 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) [2022-01-19 10:24:30,345 INFO L186 Difference]: Start difference. First operand has 210 places, 237 transitions, 999 flow. Second operand 3 states and 494 transitions. [2022-01-19 10:24:30,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 256 transitions, 1245 flow [2022-01-19 10:24:30,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 256 transitions, 1244 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:24:30,366 INFO L242 Difference]: Finished difference. Result has 212 places, 198 transitions, 759 flow [2022-01-19 10:24:30,366 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=212, PETRI_TRANSITIONS=198} [2022-01-19 10:24:30,366 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 52 predicate places. [2022-01-19 10:24:30,366 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 198 transitions, 759 flow [2022-01-19 10:24:30,367 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) [2022-01-19 10:24:30,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:30,367 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] [2022-01-19 10:24:30,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 10:24:30,367 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2022-01-19 10:24:30,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:30,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409064915] [2022-01-19 10:24:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:30,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:30,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409064915] [2022-01-19 10:24:30,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409064915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:30,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:30,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 10:24:30,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585301884] [2022-01-19 10:24:30,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:30,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 10:24:30,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 10:24:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 10:24:30,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2022-01-19 10:24:30,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 198 transitions, 759 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) [2022-01-19 10:24:30,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:30,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2022-01-19 10:24:30,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:30,885 INFO L129 PetriNetUnfolder]: 1154/3641 cut-off events. [2022-01-19 10:24:30,886 INFO L130 PetriNetUnfolder]: For 3559/3615 co-relation queries the response was YES. [2022-01-19 10:24:30,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8488 conditions, 3641 events. 1154/3641 cut-off events. For 3559/3615 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 34008 event pairs, 284 based on Foata normal form. 16/3470 useless extension candidates. Maximal degree in co-relation 8219. Up to 1180 conditions per place. [2022-01-19 10:24:30,904 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 70 selfloop transitions, 31 changer transitions 11/256 dead transitions. [2022-01-19 10:24:30,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 256 transitions, 1276 flow [2022-01-19 10:24:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 10:24:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 10:24:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2022-01-19 10:24:30,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.87743950039032 [2022-01-19 10:24:30,906 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2022-01-19 10:24:30,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2022-01-19 10:24:30,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:30,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2022-01-19 10:24:30,908 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) [2022-01-19 10:24:30,910 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) [2022-01-19 10:24:30,910 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) [2022-01-19 10:24:30,910 INFO L186 Difference]: Start difference. First operand has 212 places, 198 transitions, 759 flow. Second operand 7 states and 1124 transitions. [2022-01-19 10:24:30,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 256 transitions, 1276 flow [2022-01-19 10:24:30,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 256 transitions, 1226 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-01-19 10:24:30,923 INFO L242 Difference]: Finished difference. Result has 203 places, 213 transitions, 944 flow [2022-01-19 10:24:30,923 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=203, PETRI_TRANSITIONS=213} [2022-01-19 10:24:30,923 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2022-01-19 10:24:30,924 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 213 transitions, 944 flow [2022-01-19 10:24:30,924 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) [2022-01-19 10:24:30,924 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:30,924 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] [2022-01-19 10:24:30,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 10:24:30,924 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -260037506, now seen corresponding path program 1 times [2022-01-19 10:24:30,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:30,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307888259] [2022-01-19 10:24:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:30,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:30,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:30,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307888259] [2022-01-19 10:24:30,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307888259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:30,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:30,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:24:30,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114438813] [2022-01-19 10:24:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:30,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:24:30,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:30,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:24:30,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:24:30,958 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-01-19 10:24:30,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 213 transitions, 944 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) [2022-01-19 10:24:30,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:30,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-01-19 10:24:30,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:31,132 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[][145], [111#L739-3true, 240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 284#true, 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) (= (+ (- 1) ~ctr1~0) 0)), 101#L786-4true, 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~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: 286#(= ~ctr2~0 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|))), Black: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), 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]) [2022-01-19 10:24:31,133 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 10:24:31,133 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 10:24:31,133 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 10:24:31,133 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 10:24:31,161 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[][145], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 109#L787-2true, 284#true, 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) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~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: 286#(= ~ctr2~0 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|))), Black: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), 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]) [2022-01-19 10:24:31,161 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-01-19 10:24:31,161 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 10:24:31,161 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 10:24:31,161 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-01-19 10:24:31,201 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[][145], [240#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 79#L771-1true, 276#(= ~readerprogress2~0 2), 300#(= ~idx~0 0), 284#true, 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) (= (+ (- 1) ~ctr1~0) 0)), 194#true, 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 257#(= ~readerprogress1~0 2), Black: 281#(= (+ (- 1) ~idx~0) 0), Black: 214#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 288#(<= 1 ~ctr2~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: 286#(= ~ctr2~0 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|))), Black: 287#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), 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))]) [2022-01-19 10:24:31,202 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-01-19 10:24:31,202 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:31,202 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 10:24:31,202 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 10:24:31,213 INFO L129 PetriNetUnfolder]: 764/2775 cut-off events. [2022-01-19 10:24:31,213 INFO L130 PetriNetUnfolder]: For 4708/4776 co-relation queries the response was YES. [2022-01-19 10:24:31,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6783 conditions, 2775 events. 764/2775 cut-off events. For 4708/4776 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 23900 event pairs, 187 based on Foata normal form. 12/2643 useless extension candidates. Maximal degree in co-relation 6509. Up to 717 conditions per place. [2022-01-19 10:24:31,227 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 56 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-01-19 10:24:31,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 209 transitions, 1066 flow [2022-01-19 10:24:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:24:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:24:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-01-19 10:24:31,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-01-19 10:24:31,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-01-19 10:24:31,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-01-19 10:24:31,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:31,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-01-19 10:24:31,230 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) [2022-01-19 10:24:31,230 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) [2022-01-19 10:24:31,231 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) [2022-01-19 10:24:31,231 INFO L186 Difference]: Start difference. First operand has 203 places, 213 transitions, 944 flow. Second operand 3 states and 488 transitions. [2022-01-19 10:24:31,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 209 transitions, 1066 flow [2022-01-19 10:24:31,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 209 transitions, 1049 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-01-19 10:24:31,240 INFO L242 Difference]: Finished difference. Result has 194 places, 189 transitions, 790 flow [2022-01-19 10:24:31,241 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=194, PETRI_TRANSITIONS=189} [2022-01-19 10:24:31,241 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 34 predicate places. [2022-01-19 10:24:31,241 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 189 transitions, 790 flow [2022-01-19 10:24:31,242 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) [2022-01-19 10:24:31,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:31,242 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] [2022-01-19 10:24:31,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 10:24:31,242 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1048963744, now seen corresponding path program 1 times [2022-01-19 10:24:31,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:31,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101976638] [2022-01-19 10:24:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:31,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:31,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:31,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101976638] [2022-01-19 10:24:31,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101976638] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:31,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:31,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 10:24:31,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295319997] [2022-01-19 10:24:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:31,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:24:31,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:24:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:24:31,375 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:31,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 189 transitions, 790 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) [2022-01-19 10:24:31,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:31,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:31,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:32,078 INFO L129 PetriNetUnfolder]: 1679/4124 cut-off events. [2022-01-19 10:24:32,078 INFO L130 PetriNetUnfolder]: For 7838/7917 co-relation queries the response was YES. [2022-01-19 10:24:32,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12232 conditions, 4124 events. 1679/4124 cut-off events. For 7838/7917 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 34079 event pairs, 371 based on Foata normal form. 60/4073 useless extension candidates. Maximal degree in co-relation 11970. Up to 1724 conditions per place. [2022-01-19 10:24:32,107 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 131 selfloop transitions, 46 changer transitions 9/296 dead transitions. [2022-01-19 10:24:32,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 296 transitions, 1840 flow [2022-01-19 10:24:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:24:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:24:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2022-01-19 10:24:32,111 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2022-01-19 10:24:32,111 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2022-01-19 10:24:32,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2022-01-19 10:24:32,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:32,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2022-01-19 10:24:32,114 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) [2022-01-19 10:24:32,117 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) [2022-01-19 10:24:32,117 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) [2022-01-19 10:24:32,117 INFO L186 Difference]: Start difference. First operand has 194 places, 189 transitions, 790 flow. Second operand 11 states and 1493 transitions. [2022-01-19 10:24:32,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 296 transitions, 1840 flow [2022-01-19 10:24:32,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 296 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 10:24:32,136 INFO L242 Difference]: Finished difference. Result has 206 places, 215 transitions, 1223 flow [2022-01-19 10:24:32,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1223, PETRI_PLACES=206, PETRI_TRANSITIONS=215} [2022-01-19 10:24:32,137 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 46 predicate places. [2022-01-19 10:24:32,137 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 215 transitions, 1223 flow [2022-01-19 10:24:32,137 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) [2022-01-19 10:24:32,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:32,137 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] [2022-01-19 10:24:32,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 10:24:32,138 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 134346234, now seen corresponding path program 2 times [2022-01-19 10:24:32,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048916927] [2022-01-19 10:24:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:32,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:32,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048916927] [2022-01-19 10:24:32,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048916927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:32,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:32,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 10:24:32,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117691847] [2022-01-19 10:24:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:32,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:24:32,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:24:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:24:32,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:32,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 215 transitions, 1223 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) [2022-01-19 10:24:32,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:32,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:32,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:32,940 INFO L129 PetriNetUnfolder]: 1737/4339 cut-off events. [2022-01-19 10:24:32,940 INFO L130 PetriNetUnfolder]: For 11901/11980 co-relation queries the response was YES. [2022-01-19 10:24:32,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14116 conditions, 4339 events. 1737/4339 cut-off events. For 11901/11980 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 36723 event pairs, 434 based on Foata normal form. 65/4265 useless extension candidates. Maximal degree in co-relation 13838. Up to 1676 conditions per place. [2022-01-19 10:24:32,959 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 130 selfloop transitions, 65 changer transitions 32/337 dead transitions. [2022-01-19 10:24:32,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 337 transitions, 2586 flow [2022-01-19 10:24:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 10:24:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 10:24:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2022-01-19 10:24:32,962 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2022-01-19 10:24:32,962 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2022-01-19 10:24:32,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2022-01-19 10:24:32,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:32,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2022-01-19 10:24:32,965 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) [2022-01-19 10:24:32,967 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) [2022-01-19 10:24:32,968 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) [2022-01-19 10:24:32,968 INFO L186 Difference]: Start difference. First operand has 206 places, 215 transitions, 1223 flow. Second operand 13 states and 1753 transitions. [2022-01-19 10:24:32,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 337 transitions, 2586 flow [2022-01-19 10:24:32,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 337 transitions, 2523 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-01-19 10:24:32,990 INFO L242 Difference]: Finished difference. Result has 218 places, 231 transitions, 1591 flow [2022-01-19 10:24:32,990 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1591, PETRI_PLACES=218, PETRI_TRANSITIONS=231} [2022-01-19 10:24:32,990 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 58 predicate places. [2022-01-19 10:24:32,990 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 231 transitions, 1591 flow [2022-01-19 10:24:32,991 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) [2022-01-19 10:24:32,991 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:32,991 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] [2022-01-19 10:24:32,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 10:24:32,991 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 591801310, now seen corresponding path program 1 times [2022-01-19 10:24:32,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:32,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297787340] [2022-01-19 10:24:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:32,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:33,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297787340] [2022-01-19 10:24:33,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297787340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:33,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:33,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 10:24:33,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852019280] [2022-01-19 10:24:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:33,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 10:24:33,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:33,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 10:24:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-19 10:24:33,097 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:33,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 231 transitions, 1591 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) [2022-01-19 10:24:33,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:33,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:33,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:33,697 INFO L129 PetriNetUnfolder]: 1521/3941 cut-off events. [2022-01-19 10:24:33,698 INFO L130 PetriNetUnfolder]: For 15091/15212 co-relation queries the response was YES. [2022-01-19 10:24:33,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 3941 events. 1521/3941 cut-off events. For 15091/15212 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 33535 event pairs, 442 based on Foata normal form. 91/3892 useless extension candidates. Maximal degree in co-relation 13133. Up to 1627 conditions per place. [2022-01-19 10:24:33,722 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 137 selfloop transitions, 59 changer transitions 7/313 dead transitions. [2022-01-19 10:24:33,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 313 transitions, 2486 flow [2022-01-19 10:24:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 10:24:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 10:24:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1861 transitions. [2022-01-19 10:24:33,725 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7263856362217018 [2022-01-19 10:24:33,725 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1861 transitions. [2022-01-19 10:24:33,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1861 transitions. [2022-01-19 10:24:33,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:33,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1861 transitions. [2022-01-19 10:24:33,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 132.92857142857142) internal successors, (1861), 14 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:33,732 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) [2022-01-19 10:24:33,732 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) [2022-01-19 10:24:33,732 INFO L186 Difference]: Start difference. First operand has 218 places, 231 transitions, 1591 flow. Second operand 14 states and 1861 transitions. [2022-01-19 10:24:33,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 313 transitions, 2486 flow [2022-01-19 10:24:33,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 313 transitions, 2420 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-01-19 10:24:33,765 INFO L242 Difference]: Finished difference. Result has 229 places, 240 transitions, 1739 flow [2022-01-19 10:24:33,765 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1739, PETRI_PLACES=229, PETRI_TRANSITIONS=240} [2022-01-19 10:24:33,766 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 69 predicate places. [2022-01-19 10:24:33,766 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 240 transitions, 1739 flow [2022-01-19 10:24:33,766 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) [2022-01-19 10:24:33,766 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:33,766 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] [2022-01-19 10:24:33,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 10:24:33,766 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash 560799056, now seen corresponding path program 3 times [2022-01-19 10:24:33,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490854448] [2022-01-19 10:24:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:33,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:33,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490854448] [2022-01-19 10:24:33,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490854448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:33,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:33,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 10:24:33,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370134867] [2022-01-19 10:24:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:33,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:24:33,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:24:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:24:33,867 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:33,868 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 240 transitions, 1739 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) [2022-01-19 10:24:33,868 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:33,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:33,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:34,522 INFO L129 PetriNetUnfolder]: 1454/3824 cut-off events. [2022-01-19 10:24:34,523 INFO L130 PetriNetUnfolder]: For 15705/15853 co-relation queries the response was YES. [2022-01-19 10:24:34,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12945 conditions, 3824 events. 1454/3824 cut-off events. For 15705/15853 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 32457 event pairs, 413 based on Foata normal form. 127/3821 useless extension candidates. Maximal degree in co-relation 12675. Up to 1302 conditions per place. [2022-01-19 10:24:34,547 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 153 selfloop transitions, 64 changer transitions 16/343 dead transitions. [2022-01-19 10:24:34,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 343 transitions, 2872 flow [2022-01-19 10:24:34,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2022-01-19 10:24:34,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2022-01-19 10:24:34,550 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2022-01-19 10:24:34,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2022-01-19 10:24:34,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:34,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2022-01-19 10:24:34,553 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) [2022-01-19 10:24:34,555 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) [2022-01-19 10:24:34,555 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) [2022-01-19 10:24:34,555 INFO L186 Difference]: Start difference. First operand has 229 places, 240 transitions, 1739 flow. Second operand 12 states and 1633 transitions. [2022-01-19 10:24:34,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 343 transitions, 2872 flow [2022-01-19 10:24:34,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 343 transitions, 2817 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 10:24:34,602 INFO L242 Difference]: Finished difference. Result has 239 places, 248 transitions, 1982 flow [2022-01-19 10:24:34,602 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1982, PETRI_PLACES=239, PETRI_TRANSITIONS=248} [2022-01-19 10:24:34,602 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2022-01-19 10:24:34,602 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 248 transitions, 1982 flow [2022-01-19 10:24:34,603 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) [2022-01-19 10:24:34,603 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:34,603 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] [2022-01-19 10:24:34,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 10:24:34,603 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2015600652, now seen corresponding path program 2 times [2022-01-19 10:24:34,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:34,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58393600] [2022-01-19 10:24:34,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:34,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:34,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:34,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58393600] [2022-01-19 10:24:34,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58393600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:34,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:34,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 10:24:34,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232550792] [2022-01-19 10:24:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:34,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 10:24:34,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 10:24:34,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-19 10:24:34,699 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:34,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 1982 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) [2022-01-19 10:24:34,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:34,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:34,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:35,422 INFO L129 PetriNetUnfolder]: 1421/3787 cut-off events. [2022-01-19 10:24:35,423 INFO L130 PetriNetUnfolder]: For 19784/19940 co-relation queries the response was YES. [2022-01-19 10:24:35,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13382 conditions, 3787 events. 1421/3787 cut-off events. For 19784/19940 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 32310 event pairs, 277 based on Foata normal form. 128/3789 useless extension candidates. Maximal degree in co-relation 13106. Up to 796 conditions per place. [2022-01-19 10:24:35,448 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 153 selfloop transitions, 66 changer transitions 32/361 dead transitions. [2022-01-19 10:24:35,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 361 transitions, 3245 flow [2022-01-19 10:24:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 10:24:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 10:24:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2022-01-19 10:24:35,451 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2022-01-19 10:24:35,451 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2022-01-19 10:24:35,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2022-01-19 10:24:35,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:35,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2022-01-19 10:24:35,454 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) [2022-01-19 10:24:35,456 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) [2022-01-19 10:24:35,456 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) [2022-01-19 10:24:35,457 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 1982 flow. Second operand 16 states and 2144 transitions. [2022-01-19 10:24:35,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 361 transitions, 3245 flow [2022-01-19 10:24:35,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 361 transitions, 3152 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-01-19 10:24:35,511 INFO L242 Difference]: Finished difference. Result has 254 places, 251 transitions, 2127 flow [2022-01-19 10:24:35,511 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1908, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2127, PETRI_PLACES=254, PETRI_TRANSITIONS=251} [2022-01-19 10:24:35,512 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 94 predicate places. [2022-01-19 10:24:35,512 INFO L470 AbstractCegarLoop]: Abstraction has has 254 places, 251 transitions, 2127 flow [2022-01-19 10:24:35,512 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) [2022-01-19 10:24:35,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:35,512 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] [2022-01-19 10:24:35,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 10:24:35,512 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash 915709298, now seen corresponding path program 3 times [2022-01-19 10:24:35,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210386031] [2022-01-19 10:24:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:35,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:35,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:35,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210386031] [2022-01-19 10:24:35,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210386031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:35,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:35,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 10:24:35,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256552078] [2022-01-19 10:24:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:35,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 10:24:35,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 10:24:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-19 10:24:35,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:35,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 251 transitions, 2127 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) [2022-01-19 10:24:35,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:35,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:35,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:36,344 INFO L129 PetriNetUnfolder]: 1367/3639 cut-off events. [2022-01-19 10:24:36,344 INFO L130 PetriNetUnfolder]: For 21962/22081 co-relation queries the response was YES. [2022-01-19 10:24:36,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13105 conditions, 3639 events. 1367/3639 cut-off events. For 21962/22081 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 30863 event pairs, 415 based on Foata normal form. 99/3610 useless extension candidates. Maximal degree in co-relation 12824. Up to 1352 conditions per place. [2022-01-19 10:24:36,370 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 134 selfloop transitions, 72 changer transitions 8/324 dead transitions. [2022-01-19 10:24:36,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 324 transitions, 2985 flow [2022-01-19 10:24:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 10:24:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 10:24:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1981 transitions. [2022-01-19 10:24:36,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7216757741347906 [2022-01-19 10:24:36,373 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1981 transitions. [2022-01-19 10:24:36,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1981 transitions. [2022-01-19 10:24:36,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:36,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1981 transitions. [2022-01-19 10:24:36,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 132.06666666666666) internal successors, (1981), 15 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:36,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:36,378 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:36,378 INFO L186 Difference]: Start difference. First operand has 254 places, 251 transitions, 2127 flow. Second operand 15 states and 1981 transitions. [2022-01-19 10:24:36,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 324 transitions, 2985 flow [2022-01-19 10:24:36,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 324 transitions, 2904 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-01-19 10:24:36,446 INFO L242 Difference]: Finished difference. Result has 264 places, 255 transitions, 2265 flow [2022-01-19 10:24:36,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2265, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2022-01-19 10:24:36,446 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 104 predicate places. [2022-01-19 10:24:36,447 INFO L470 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 2265 flow [2022-01-19 10:24:36,447 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) [2022-01-19 10:24:36,447 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:36,447 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] [2022-01-19 10:24:36,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 10:24:36,447 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1065945954, now seen corresponding path program 1 times [2022-01-19 10:24:36,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:36,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654529479] [2022-01-19 10:24:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:36,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:36,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:36,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654529479] [2022-01-19 10:24:36,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654529479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:36,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:36,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 10:24:36,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992813543] [2022-01-19 10:24:36,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:36,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:24:36,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:24:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:24:36,546 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:36,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 2265 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) [2022-01-19 10:24:36,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:36,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:36,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:37,188 INFO L129 PetriNetUnfolder]: 1335/3657 cut-off events. [2022-01-19 10:24:37,189 INFO L130 PetriNetUnfolder]: For 24193/24362 co-relation queries the response was YES. [2022-01-19 10:24:37,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13271 conditions, 3657 events. 1335/3657 cut-off events. For 24193/24362 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 30942 event pairs, 147 based on Foata normal form. 161/3693 useless extension candidates. Maximal degree in co-relation 12993. Up to 901 conditions per place. [2022-01-19 10:24:37,214 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 173 selfloop transitions, 62 changer transitions 27/372 dead transitions. [2022-01-19 10:24:37,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 372 transitions, 3690 flow [2022-01-19 10:24:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2022-01-19 10:24:37,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2022-01-19 10:24:37,217 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2022-01-19 10:24:37,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2022-01-19 10:24:37,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:37,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2022-01-19 10:24:37,219 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) [2022-01-19 10:24:37,221 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) [2022-01-19 10:24:37,221 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) [2022-01-19 10:24:37,221 INFO L186 Difference]: Start difference. First operand has 264 places, 255 transitions, 2265 flow. Second operand 12 states and 1639 transitions. [2022-01-19 10:24:37,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 372 transitions, 3690 flow [2022-01-19 10:24:37,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 372 transitions, 3518 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-01-19 10:24:37,293 INFO L242 Difference]: Finished difference. Result has 272 places, 272 transitions, 2567 flow [2022-01-19 10:24:37,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2567, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2022-01-19 10:24:37,293 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 112 predicate places. [2022-01-19 10:24:37,293 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 2567 flow [2022-01-19 10:24:37,294 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) [2022-01-19 10:24:37,294 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:37,294 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] [2022-01-19 10:24:37,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 10:24:37,294 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1880396016, now seen corresponding path program 1 times [2022-01-19 10:24:37,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364658657] [2022-01-19 10:24:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:37,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:37,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364658657] [2022-01-19 10:24:37,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364658657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:37,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:37,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 10:24:37,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275090164] [2022-01-19 10:24:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:37,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 10:24:37,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 10:24:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-19 10:24:37,388 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:37,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 2567 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) [2022-01-19 10:24:37,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:37,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:37,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:38,115 INFO L129 PetriNetUnfolder]: 1175/3584 cut-off events. [2022-01-19 10:24:38,116 INFO L130 PetriNetUnfolder]: For 25466/25646 co-relation queries the response was YES. [2022-01-19 10:24:38,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13182 conditions, 3584 events. 1175/3584 cut-off events. For 25466/25646 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 31337 event pairs, 148 based on Foata normal form. 159/3624 useless extension candidates. Maximal degree in co-relation 12890. Up to 468 conditions per place. [2022-01-19 10:24:38,143 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 160 selfloop transitions, 73 changer transitions 37/380 dead transitions. [2022-01-19 10:24:38,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 380 transitions, 3849 flow [2022-01-19 10:24:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 10:24:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 10:24:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2022-01-19 10:24:38,145 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2022-01-19 10:24:38,145 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2022-01-19 10:24:38,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2022-01-19 10:24:38,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:38,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2022-01-19 10:24:38,148 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) [2022-01-19 10:24:38,150 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) [2022-01-19 10:24:38,150 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) [2022-01-19 10:24:38,150 INFO L186 Difference]: Start difference. First operand has 272 places, 272 transitions, 2567 flow. Second operand 16 states and 2146 transitions. [2022-01-19 10:24:38,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 380 transitions, 3849 flow [2022-01-19 10:24:38,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 380 transitions, 3781 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-01-19 10:24:38,217 INFO L242 Difference]: Finished difference. Result has 290 places, 274 transitions, 2732 flow [2022-01-19 10:24:38,218 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2732, PETRI_PLACES=290, PETRI_TRANSITIONS=274} [2022-01-19 10:24:38,218 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 130 predicate places. [2022-01-19 10:24:38,218 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 274 transitions, 2732 flow [2022-01-19 10:24:38,218 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) [2022-01-19 10:24:38,218 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:38,218 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] [2022-01-19 10:24:38,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 10:24:38,219 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -938654044, now seen corresponding path program 2 times [2022-01-19 10:24:38,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:38,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953702742] [2022-01-19 10:24:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:38,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:38,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953702742] [2022-01-19 10:24:38,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953702742] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:38,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:38,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 10:24:38,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947615204] [2022-01-19 10:24:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:38,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:24:38,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:24:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:24:38,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:38,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 274 transitions, 2732 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) [2022-01-19 10:24:38,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:38,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:38,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:38,964 INFO L129 PetriNetUnfolder]: 1100/3316 cut-off events. [2022-01-19 10:24:38,964 INFO L130 PetriNetUnfolder]: For 28950/29064 co-relation queries the response was YES. [2022-01-19 10:24:38,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12799 conditions, 3316 events. 1100/3316 cut-off events. For 28950/29064 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28323 event pairs, 251 based on Foata normal form. 101/3287 useless extension candidates. Maximal degree in co-relation 12501. Up to 963 conditions per place. [2022-01-19 10:24:38,991 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 155 selfloop transitions, 71 changer transitions 17/353 dead transitions. [2022-01-19 10:24:38,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 353 transitions, 3795 flow [2022-01-19 10:24:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2022-01-19 10:24:38,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2022-01-19 10:24:38,993 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2022-01-19 10:24:38,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2022-01-19 10:24:38,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:38,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2022-01-19 10:24:38,995 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) [2022-01-19 10:24:38,997 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) [2022-01-19 10:24:38,997 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) [2022-01-19 10:24:38,997 INFO L186 Difference]: Start difference. First operand has 290 places, 274 transitions, 2732 flow. Second operand 12 states and 1618 transitions. [2022-01-19 10:24:38,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 353 transitions, 3795 flow [2022-01-19 10:24:39,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 353 transitions, 3652 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-01-19 10:24:39,075 INFO L242 Difference]: Finished difference. Result has 294 places, 276 transitions, 2859 flow [2022-01-19 10:24:39,076 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2611, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2859, PETRI_PLACES=294, PETRI_TRANSITIONS=276} [2022-01-19 10:24:39,076 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 134 predicate places. [2022-01-19 10:24:39,076 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 276 transitions, 2859 flow [2022-01-19 10:24:39,076 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) [2022-01-19 10:24:39,076 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:39,077 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] [2022-01-19 10:24:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 10:24:39,077 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -140786344, now seen corresponding path program 2 times [2022-01-19 10:24:39,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600296813] [2022-01-19 10:24:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:39,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:39,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:39,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600296813] [2022-01-19 10:24:39,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600296813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:39,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:39,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 10:24:39,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945809416] [2022-01-19 10:24:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:39,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 10:24:39,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 10:24:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-19 10:24:39,179 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-01-19 10:24:39,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 276 transitions, 2859 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) [2022-01-19 10:24:39,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:39,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-01-19 10:24:39,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:39,851 INFO L129 PetriNetUnfolder]: 935/2980 cut-off events. [2022-01-19 10:24:39,851 INFO L130 PetriNetUnfolder]: For 28607/28717 co-relation queries the response was YES. [2022-01-19 10:24:39,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11662 conditions, 2980 events. 935/2980 cut-off events. For 28607/28717 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25146 event pairs, 202 based on Foata normal form. 92/2953 useless extension candidates. Maximal degree in co-relation 11415. Up to 789 conditions per place. [2022-01-19 10:24:39,874 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 144 selfloop transitions, 74 changer transitions 21/344 dead transitions. [2022-01-19 10:24:39,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 344 transitions, 3743 flow [2022-01-19 10:24:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 10:24:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 10:24:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1982 transitions. [2022-01-19 10:24:39,879 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.722040072859745 [2022-01-19 10:24:39,879 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1982 transitions. [2022-01-19 10:24:39,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1982 transitions. [2022-01-19 10:24:39,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:39,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1982 transitions. [2022-01-19 10:24:39,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 132.13333333333333) internal successors, (1982), 15 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:39,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:39,891 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:39,891 INFO L186 Difference]: Start difference. First operand has 294 places, 276 transitions, 2859 flow. Second operand 15 states and 1982 transitions. [2022-01-19 10:24:39,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 344 transitions, 3743 flow [2022-01-19 10:24:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 344 transitions, 3691 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-01-19 10:24:39,975 INFO L242 Difference]: Finished difference. Result has 301 places, 262 transitions, 2828 flow [2022-01-19 10:24:39,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2775, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2828, PETRI_PLACES=301, PETRI_TRANSITIONS=262} [2022-01-19 10:24:39,976 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2022-01-19 10:24:39,976 INFO L470 AbstractCegarLoop]: Abstraction has has 301 places, 262 transitions, 2828 flow [2022-01-19 10:24:39,977 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) [2022-01-19 10:24:39,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:39,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, 1, 1, 1, 1, 1] [2022-01-19 10:24:39,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 10:24:39,977 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1398292697, now seen corresponding path program 1 times [2022-01-19 10:24:39,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:39,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945898731] [2022-01-19 10:24:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:39,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:40,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:40,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945898731] [2022-01-19 10:24:40,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945898731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:40,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:40,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:40,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542426684] [2022-01-19 10:24:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:40,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:40,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:40,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:40,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 262 transitions, 2828 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) [2022-01-19 10:24:40,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:40,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:40,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:40,431 INFO L129 PetriNetUnfolder]: 563/2124 cut-off events. [2022-01-19 10:24:40,431 INFO L130 PetriNetUnfolder]: For 19610/19643 co-relation queries the response was YES. [2022-01-19 10:24:40,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7976 conditions, 2124 events. 563/2124 cut-off events. For 19610/19643 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16633 event pairs, 108 based on Foata normal form. 15/2056 useless extension candidates. Maximal degree in co-relation 7769. Up to 278 conditions per place. [2022-01-19 10:24:40,448 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 108 selfloop transitions, 37 changer transitions 51/331 dead transitions. [2022-01-19 10:24:40,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 331 transitions, 3728 flow [2022-01-19 10:24:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:24:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:24:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2022-01-19 10:24:40,452 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2022-01-19 10:24:40,452 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2022-01-19 10:24:40,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2022-01-19 10:24:40,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:40,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2022-01-19 10:24:40,454 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) [2022-01-19 10:24:40,455 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) [2022-01-19 10:24:40,455 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) [2022-01-19 10:24:40,456 INFO L186 Difference]: Start difference. First operand has 301 places, 262 transitions, 2828 flow. Second operand 11 states and 1625 transitions. [2022-01-19 10:24:40,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 331 transitions, 3728 flow [2022-01-19 10:24:40,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 331 transitions, 3390 flow, removed 30 selfloop flow, removed 22 redundant places. [2022-01-19 10:24:40,498 INFO L242 Difference]: Finished difference. Result has 287 places, 238 transitions, 2234 flow [2022-01-19 10:24:40,499 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2234, PETRI_PLACES=287, PETRI_TRANSITIONS=238} [2022-01-19 10:24:40,499 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2022-01-19 10:24:40,499 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 238 transitions, 2234 flow [2022-01-19 10:24:40,499 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) [2022-01-19 10:24:40,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:40,499 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] [2022-01-19 10:24:40,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 10:24:40,500 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash 306531641, now seen corresponding path program 2 times [2022-01-19 10:24:40,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:40,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412994667] [2022-01-19 10:24:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:40,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:40,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:40,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412994667] [2022-01-19 10:24:40,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412994667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:40,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:40,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:40,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409389229] [2022-01-19 10:24:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:40,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:40,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:40,559 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:40,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 238 transitions, 2234 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) [2022-01-19 10:24:40,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:40,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:40,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:40,910 INFO L129 PetriNetUnfolder]: 521/1844 cut-off events. [2022-01-19 10:24:40,910 INFO L130 PetriNetUnfolder]: For 13583/13642 co-relation queries the response was YES. [2022-01-19 10:24:40,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6703 conditions, 1844 events. 521/1844 cut-off events. For 13583/13642 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13699 event pairs, 91 based on Foata normal form. 35/1791 useless extension candidates. Maximal degree in co-relation 6572. Up to 289 conditions per place. [2022-01-19 10:24:40,927 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 45 changer transitions 23/313 dead transitions. [2022-01-19 10:24:40,927 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 313 transitions, 3233 flow [2022-01-19 10:24:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2022-01-19 10:24:40,929 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2022-01-19 10:24:40,929 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2022-01-19 10:24:40,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2022-01-19 10:24:40,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:40,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2022-01-19 10:24:40,931 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) [2022-01-19 10:24:40,932 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) [2022-01-19 10:24:40,932 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) [2022-01-19 10:24:40,933 INFO L186 Difference]: Start difference. First operand has 287 places, 238 transitions, 2234 flow. Second operand 12 states and 1767 transitions. [2022-01-19 10:24:40,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 313 transitions, 3233 flow [2022-01-19 10:24:40,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 313 transitions, 2869 flow, removed 37 selfloop flow, removed 29 redundant places. [2022-01-19 10:24:40,964 INFO L242 Difference]: Finished difference. Result has 275 places, 250 transitions, 2216 flow [2022-01-19 10:24:40,964 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2216, PETRI_PLACES=275, PETRI_TRANSITIONS=250} [2022-01-19 10:24:40,964 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2022-01-19 10:24:40,964 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 250 transitions, 2216 flow [2022-01-19 10:24:40,965 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) [2022-01-19 10:24:40,965 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:40,965 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] [2022-01-19 10:24:40,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 10:24:40,965 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash -750576933, now seen corresponding path program 3 times [2022-01-19 10:24:40,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990458505] [2022-01-19 10:24:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:40,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:41,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:41,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990458505] [2022-01-19 10:24:41,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990458505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:41,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:41,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:41,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993118100] [2022-01-19 10:24:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:41,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:41,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:41,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:41,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 250 transitions, 2216 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) [2022-01-19 10:24:41,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:41,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:41,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:41,417 INFO L129 PetriNetUnfolder]: 538/1992 cut-off events. [2022-01-19 10:24:41,417 INFO L130 PetriNetUnfolder]: For 12090/12168 co-relation queries the response was YES. [2022-01-19 10:24:41,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 1992 events. 538/1992 cut-off events. For 12090/12168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15353 event pairs, 107 based on Foata normal form. 41/1926 useless extension candidates. Maximal degree in co-relation 6420. Up to 279 conditions per place. [2022-01-19 10:24:41,428 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 105 selfloop transitions, 52 changer transitions 37/329 dead transitions. [2022-01-19 10:24:41,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 329 transitions, 3234 flow [2022-01-19 10:24:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2022-01-19 10:24:41,430 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2022-01-19 10:24:41,430 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2022-01-19 10:24:41,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2022-01-19 10:24:41,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:41,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2022-01-19 10:24:41,432 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) [2022-01-19 10:24:41,434 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) [2022-01-19 10:24:41,434 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) [2022-01-19 10:24:41,434 INFO L186 Difference]: Start difference. First operand has 275 places, 250 transitions, 2216 flow. Second operand 12 states and 1769 transitions. [2022-01-19 10:24:41,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 329 transitions, 3234 flow [2022-01-19 10:24:41,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 329 transitions, 3163 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-01-19 10:24:41,458 INFO L242 Difference]: Finished difference. Result has 288 places, 256 transitions, 2375 flow [2022-01-19 10:24:41,459 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2375, PETRI_PLACES=288, PETRI_TRANSITIONS=256} [2022-01-19 10:24:41,459 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 128 predicate places. [2022-01-19 10:24:41,459 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 256 transitions, 2375 flow [2022-01-19 10:24:41,459 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) [2022-01-19 10:24:41,459 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:41,459 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] [2022-01-19 10:24:41,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 10:24:41,459 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 81452005, now seen corresponding path program 4 times [2022-01-19 10:24:41,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078499803] [2022-01-19 10:24:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:41,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:41,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078499803] [2022-01-19 10:24:41,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078499803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:41,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:41,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:24:41,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445013592] [2022-01-19 10:24:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:41,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:24:41,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:24:41,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:24:41,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-01-19 10:24:41,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 256 transitions, 2375 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) [2022-01-19 10:24:41,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:41,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-01-19 10:24:41,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:41,732 INFO L129 PetriNetUnfolder]: 432/1923 cut-off events. [2022-01-19 10:24:41,732 INFO L130 PetriNetUnfolder]: For 13543/13630 co-relation queries the response was YES. [2022-01-19 10:24:41,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6568 conditions, 1923 events. 432/1923 cut-off events. For 13543/13630 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15085 event pairs, 109 based on Foata normal form. 46/1841 useless extension candidates. Maximal degree in co-relation 6400. Up to 343 conditions per place. [2022-01-19 10:24:41,744 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 91 selfloop transitions, 10 changer transitions 8/278 dead transitions. [2022-01-19 10:24:41,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 2786 flow [2022-01-19 10:24:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:24:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:24:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2022-01-19 10:24:41,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2022-01-19 10:24:41,746 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2022-01-19 10:24:41,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2022-01-19 10:24:41,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:41,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2022-01-19 10:24:41,747 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) [2022-01-19 10:24:41,747 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) [2022-01-19 10:24:41,755 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) [2022-01-19 10:24:41,755 INFO L186 Difference]: Start difference. First operand has 288 places, 256 transitions, 2375 flow. Second operand 4 states and 643 transitions. [2022-01-19 10:24:41,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 2786 flow [2022-01-19 10:24:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 278 transitions, 2656 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-19 10:24:41,786 INFO L242 Difference]: Finished difference. Result has 285 places, 255 transitions, 2285 flow [2022-01-19 10:24:41,786 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2285, PETRI_PLACES=285, PETRI_TRANSITIONS=255} [2022-01-19 10:24:41,786 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 125 predicate places. [2022-01-19 10:24:41,786 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 255 transitions, 2285 flow [2022-01-19 10:24:41,786 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) [2022-01-19 10:24:41,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:41,787 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] [2022-01-19 10:24:41,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 10:24:41,787 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:41,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1448459419, now seen corresponding path program 5 times [2022-01-19 10:24:41,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:41,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793137275] [2022-01-19 10:24:41,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:41,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:41,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:41,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793137275] [2022-01-19 10:24:41,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793137275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:41,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:41,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:41,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140182944] [2022-01-19 10:24:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:41,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:41,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:41,857 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:41,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 255 transitions, 2285 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) [2022-01-19 10:24:41,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:41,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:41,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:42,199 INFO L129 PetriNetUnfolder]: 493/1999 cut-off events. [2022-01-19 10:24:42,200 INFO L130 PetriNetUnfolder]: For 13779/13945 co-relation queries the response was YES. [2022-01-19 10:24:42,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 1999 events. 493/1999 cut-off events. For 13779/13945 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15703 event pairs, 112 based on Foata normal form. 98/1979 useless extension candidates. Maximal degree in co-relation 6870. Up to 259 conditions per place. [2022-01-19 10:24:42,212 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 100 selfloop transitions, 52 changer transitions 43/330 dead transitions. [2022-01-19 10:24:42,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 330 transitions, 3374 flow [2022-01-19 10:24:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 10:24:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 10:24:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2022-01-19 10:24:42,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2022-01-19 10:24:42,214 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2022-01-19 10:24:42,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2022-01-19 10:24:42,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:42,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2022-01-19 10:24:42,216 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) [2022-01-19 10:24:42,218 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) [2022-01-19 10:24:42,218 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) [2022-01-19 10:24:42,218 INFO L186 Difference]: Start difference. First operand has 285 places, 255 transitions, 2285 flow. Second operand 14 states and 2047 transitions. [2022-01-19 10:24:42,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 330 transitions, 3374 flow [2022-01-19 10:24:42,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 330 transitions, 3318 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-01-19 10:24:42,245 INFO L242 Difference]: Finished difference. Result has 299 places, 255 transitions, 2433 flow [2022-01-19 10:24:42,246 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2205, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2433, PETRI_PLACES=299, PETRI_TRANSITIONS=255} [2022-01-19 10:24:42,246 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 139 predicate places. [2022-01-19 10:24:42,246 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 255 transitions, 2433 flow [2022-01-19 10:24:42,246 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) [2022-01-19 10:24:42,246 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:42,246 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] [2022-01-19 10:24:42,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 10:24:42,247 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1658393395, now seen corresponding path program 1 times [2022-01-19 10:24:42,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:42,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660684592] [2022-01-19 10:24:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:42,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:42,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:42,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660684592] [2022-01-19 10:24:42,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660684592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:42,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:42,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:42,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802504435] [2022-01-19 10:24:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:42,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:42,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:42,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:42,296 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:42,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 255 transitions, 2433 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) [2022-01-19 10:24:42,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:42,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:42,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:42,573 INFO L129 PetriNetUnfolder]: 419/1780 cut-off events. [2022-01-19 10:24:42,573 INFO L130 PetriNetUnfolder]: For 14511/14682 co-relation queries the response was YES. [2022-01-19 10:24:42,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6545 conditions, 1780 events. 419/1780 cut-off events. For 14511/14682 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 13507 event pairs, 88 based on Foata normal form. 114/1796 useless extension candidates. Maximal degree in co-relation 6357. Up to 284 conditions per place. [2022-01-19 10:24:42,584 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 92 selfloop transitions, 39 changer transitions 40/297 dead transitions. [2022-01-19 10:24:42,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 297 transitions, 3116 flow [2022-01-19 10:24:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:24:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:24:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1599 transitions. [2022-01-19 10:24:42,586 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7943368107302533 [2022-01-19 10:24:42,586 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1599 transitions. [2022-01-19 10:24:42,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1599 transitions. [2022-01-19 10:24:42,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:42,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1599 transitions. [2022-01-19 10:24:42,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.36363636363637) internal successors, (1599), 11 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:42,589 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) [2022-01-19 10:24:42,589 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) [2022-01-19 10:24:42,589 INFO L186 Difference]: Start difference. First operand has 299 places, 255 transitions, 2433 flow. Second operand 11 states and 1599 transitions. [2022-01-19 10:24:42,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 297 transitions, 3116 flow [2022-01-19 10:24:42,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 2994 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-01-19 10:24:42,617 INFO L242 Difference]: Finished difference. Result has 296 places, 229 transitions, 1927 flow [2022-01-19 10:24:42,617 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2320, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1927, PETRI_PLACES=296, PETRI_TRANSITIONS=229} [2022-01-19 10:24:42,618 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 136 predicate places. [2022-01-19 10:24:42,618 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 229 transitions, 1927 flow [2022-01-19 10:24:42,618 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) [2022-01-19 10:24:42,618 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:42,618 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] [2022-01-19 10:24:42,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 10:24:42,618 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 802254649, now seen corresponding path program 2 times [2022-01-19 10:24:42,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:42,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468355740] [2022-01-19 10:24:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:42,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:42,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468355740] [2022-01-19 10:24:42,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468355740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:42,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:42,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:42,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201566597] [2022-01-19 10:24:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:42,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:42,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:42,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:42,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:42,674 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:42,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 229 transitions, 1927 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) [2022-01-19 10:24:42,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:42,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:42,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:42,909 INFO L129 PetriNetUnfolder]: 289/1340 cut-off events. [2022-01-19 10:24:42,909 INFO L130 PetriNetUnfolder]: For 8268/8400 co-relation queries the response was YES. [2022-01-19 10:24:42,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1340 events. 289/1340 cut-off events. For 8268/8400 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9162 event pairs, 48 based on Foata normal form. 113/1371 useless extension candidates. Maximal degree in co-relation 4299. Up to 139 conditions per place. [2022-01-19 10:24:42,917 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 93 selfloop transitions, 42 changer transitions 30/284 dead transitions. [2022-01-19 10:24:42,917 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 284 transitions, 2786 flow [2022-01-19 10:24:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:24:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:24:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1609 transitions. [2022-01-19 10:24:42,918 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.799304520615996 [2022-01-19 10:24:42,918 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1609 transitions. [2022-01-19 10:24:42,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1609 transitions. [2022-01-19 10:24:42,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:42,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1609 transitions. [2022-01-19 10:24:42,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.27272727272728) internal successors, (1609), 11 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:42,921 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) [2022-01-19 10:24:42,921 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) [2022-01-19 10:24:42,921 INFO L186 Difference]: Start difference. First operand has 296 places, 229 transitions, 1927 flow. Second operand 11 states and 1609 transitions. [2022-01-19 10:24:42,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 284 transitions, 2786 flow [2022-01-19 10:24:42,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 284 transitions, 2411 flow, removed 9 selfloop flow, removed 33 redundant places. [2022-01-19 10:24:42,940 INFO L242 Difference]: Finished difference. Result has 275 places, 226 transitions, 1752 flow [2022-01-19 10:24:42,940 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1752, PETRI_PLACES=275, PETRI_TRANSITIONS=226} [2022-01-19 10:24:42,940 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2022-01-19 10:24:42,941 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 226 transitions, 1752 flow [2022-01-19 10:24:42,941 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) [2022-01-19 10:24:42,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:42,941 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] [2022-01-19 10:24:42,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 10:24:42,941 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -3585930, now seen corresponding path program 1 times [2022-01-19 10:24:42,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706965713] [2022-01-19 10:24:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:42,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:42,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706965713] [2022-01-19 10:24:42,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706965713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:42,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:42,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:42,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97715726] [2022-01-19 10:24:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:42,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:42,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:42,996 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:42,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 226 transitions, 1752 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) [2022-01-19 10:24:42,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:42,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:42,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:43,173 INFO L129 PetriNetUnfolder]: 227/1069 cut-off events. [2022-01-19 10:24:43,173 INFO L130 PetriNetUnfolder]: For 5100/5217 co-relation queries the response was YES. [2022-01-19 10:24:43,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1069 events. 227/1069 cut-off events. For 5100/5217 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6666 event pairs, 50 based on Foata normal form. 89/1071 useless extension candidates. Maximal degree in co-relation 3223. Up to 140 conditions per place. [2022-01-19 10:24:43,178 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 46 selfloop transitions, 19 changer transitions 81/252 dead transitions. [2022-01-19 10:24:43,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 252 transitions, 2254 flow [2022-01-19 10:24:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 10:24:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 10:24:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1445 transitions. [2022-01-19 10:24:43,180 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7896174863387978 [2022-01-19 10:24:43,180 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1445 transitions. [2022-01-19 10:24:43,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1445 transitions. [2022-01-19 10:24:43,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:43,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1445 transitions. [2022-01-19 10:24:43,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.5) internal successors, (1445), 10 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:24:43,183 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) [2022-01-19 10:24:43,183 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) [2022-01-19 10:24:43,183 INFO L186 Difference]: Start difference. First operand has 275 places, 226 transitions, 1752 flow. Second operand 10 states and 1445 transitions. [2022-01-19 10:24:43,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 252 transitions, 2254 flow [2022-01-19 10:24:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 252 transitions, 2142 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-01-19 10:24:43,197 INFO L242 Difference]: Finished difference. Result has 271 places, 162 transitions, 937 flow [2022-01-19 10:24:43,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=937, PETRI_PLACES=271, PETRI_TRANSITIONS=162} [2022-01-19 10:24:43,197 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2022-01-19 10:24:43,197 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 162 transitions, 937 flow [2022-01-19 10:24:43,198 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) [2022-01-19 10:24:43,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:43,198 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] [2022-01-19 10:24:43,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 10:24:43,198 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1149025959, now seen corresponding path program 3 times [2022-01-19 10:24:43,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408522727] [2022-01-19 10:24:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:43,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:43,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:43,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408522727] [2022-01-19 10:24:43,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408522727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:43,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:43,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:43,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266326675] [2022-01-19 10:24:43,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:43,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:43,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:43,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:43,252 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:43,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 162 transitions, 937 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) [2022-01-19 10:24:43,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:43,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:43,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:43,401 INFO L129 PetriNetUnfolder]: 154/713 cut-off events. [2022-01-19 10:24:43,401 INFO L130 PetriNetUnfolder]: For 2800/2832 co-relation queries the response was YES. [2022-01-19 10:24:43,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 713 events. 154/713 cut-off events. For 2800/2832 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3752 event pairs, 44 based on Foata normal form. 24/681 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2022-01-19 10:24:43,405 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 52 selfloop transitions, 29 changer transitions 14/201 dead transitions. [2022-01-19 10:24:43,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 201 transitions, 1471 flow [2022-01-19 10:24:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:24:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:24:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1726 transitions. [2022-01-19 10:24:43,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7859744990892532 [2022-01-19 10:24:43,406 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1726 transitions. [2022-01-19 10:24:43,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1726 transitions. [2022-01-19 10:24:43,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:43,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1726 transitions. [2022-01-19 10:24:43,408 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) [2022-01-19 10:24:43,409 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) [2022-01-19 10:24:43,410 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) [2022-01-19 10:24:43,410 INFO L186 Difference]: Start difference. First operand has 271 places, 162 transitions, 937 flow. Second operand 12 states and 1726 transitions. [2022-01-19 10:24:43,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 201 transitions, 1471 flow [2022-01-19 10:24:43,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 201 transitions, 1083 flow, removed 18 selfloop flow, removed 58 redundant places. [2022-01-19 10:24:43,416 INFO L242 Difference]: Finished difference. Result has 203 places, 170 transitions, 813 flow [2022-01-19 10:24:43,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=187, 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=813, PETRI_PLACES=203, PETRI_TRANSITIONS=170} [2022-01-19 10:24:43,417 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2022-01-19 10:24:43,417 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 170 transitions, 813 flow [2022-01-19 10:24:43,417 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) [2022-01-19 10:24:43,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:43,417 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] [2022-01-19 10:24:43,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 10:24:43,417 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:43,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1002327275, now seen corresponding path program 4 times [2022-01-19 10:24:43,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:43,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754566638] [2022-01-19 10:24:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:43,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:43,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:43,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754566638] [2022-01-19 10:24:43,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754566638] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:43,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:43,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:24:43,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011209370] [2022-01-19 10:24:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:43,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:24:43,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:24:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:24:43,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-01-19 10:24:43,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 170 transitions, 813 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) [2022-01-19 10:24:43,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:43,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-01-19 10:24:43,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:43,523 INFO L129 PetriNetUnfolder]: 135/728 cut-off events. [2022-01-19 10:24:43,523 INFO L130 PetriNetUnfolder]: For 1957/1995 co-relation queries the response was YES. [2022-01-19 10:24:43,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 728 events. 135/728 cut-off events. For 1957/1995 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3881 event pairs, 49 based on Foata normal form. 21/692 useless extension candidates. Maximal degree in co-relation 1852. Up to 100 conditions per place. [2022-01-19 10:24:43,526 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 50 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2022-01-19 10:24:43,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 184 transitions, 1036 flow [2022-01-19 10:24:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:24:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:24:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2022-01-19 10:24:43,527 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8688524590163934 [2022-01-19 10:24:43,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2022-01-19 10:24:43,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2022-01-19 10:24:43,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:43,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2022-01-19 10:24:43,528 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) [2022-01-19 10:24:43,528 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) [2022-01-19 10:24:43,529 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) [2022-01-19 10:24:43,529 INFO L186 Difference]: Start difference. First operand has 203 places, 170 transitions, 813 flow. Second operand 4 states and 636 transitions. [2022-01-19 10:24:43,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 184 transitions, 1036 flow [2022-01-19 10:24:43,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 184 transitions, 952 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-01-19 10:24:43,534 INFO L242 Difference]: Finished difference. Result has 199 places, 171 transitions, 786 flow [2022-01-19 10:24:43,534 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=194, 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=786, PETRI_PLACES=199, PETRI_TRANSITIONS=171} [2022-01-19 10:24:43,534 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 39 predicate places. [2022-01-19 10:24:43,534 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 171 transitions, 786 flow [2022-01-19 10:24:43,535 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) [2022-01-19 10:24:43,535 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:43,535 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] [2022-01-19 10:24:43,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 10:24:43,535 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1988601391, now seen corresponding path program 5 times [2022-01-19 10:24:43,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:43,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323423697] [2022-01-19 10:24:43,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:43,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:43,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323423697] [2022-01-19 10:24:43,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323423697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:43,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:43,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:43,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120585429] [2022-01-19 10:24:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:43,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:43,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:43,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:43,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 171 transitions, 786 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) [2022-01-19 10:24:43,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:43,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:43,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:43,754 INFO L129 PetriNetUnfolder]: 161/785 cut-off events. [2022-01-19 10:24:43,754 INFO L130 PetriNetUnfolder]: For 2459/2559 co-relation queries the response was YES. [2022-01-19 10:24:43,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 785 events. 161/785 cut-off events. For 2459/2559 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4375 event pairs, 47 based on Foata normal form. 72/798 useless extension candidates. Maximal degree in co-relation 2072. Up to 84 conditions per place. [2022-01-19 10:24:43,757 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 29 changer transitions 25/206 dead transitions. [2022-01-19 10:24:43,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 1269 flow [2022-01-19 10:24:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 10:24:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 10:24:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1863 transitions. [2022-01-19 10:24:43,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7831021437578815 [2022-01-19 10:24:43,758 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1863 transitions. [2022-01-19 10:24:43,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1863 transitions. [2022-01-19 10:24:43,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:43,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1863 transitions. [2022-01-19 10:24:43,760 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) [2022-01-19 10:24:43,761 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) [2022-01-19 10:24:43,762 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) [2022-01-19 10:24:43,762 INFO L186 Difference]: Start difference. First operand has 199 places, 171 transitions, 786 flow. Second operand 13 states and 1863 transitions. [2022-01-19 10:24:43,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 1269 flow [2022-01-19 10:24:43,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 206 transitions, 1224 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-01-19 10:24:43,767 INFO L242 Difference]: Finished difference. Result has 210 places, 169 transitions, 853 flow [2022-01-19 10:24:43,767 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=194, 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=853, PETRI_PLACES=210, PETRI_TRANSITIONS=169} [2022-01-19 10:24:43,768 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2022-01-19 10:24:43,768 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 169 transitions, 853 flow [2022-01-19 10:24:43,768 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) [2022-01-19 10:24:43,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:24:43,768 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] [2022-01-19 10:24:43,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 10:24:43,768 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 10:24:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:24:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 655643165, now seen corresponding path program 1 times [2022-01-19 10:24:43,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:24:43,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815787426] [2022-01-19 10:24:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:24:43,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:24:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:24:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:24:43,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:24:43,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815787426] [2022-01-19 10:24:43,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815787426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:24:43,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:24:43,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 10:24:43,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506646698] [2022-01-19 10:24:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:24:43,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 10:24:43,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:24:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 10:24:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:24:43,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-01-19 10:24:43,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 169 transitions, 853 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) [2022-01-19 10:24:43,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:24:43,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-01-19 10:24:43,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:24:43,912 INFO L129 PetriNetUnfolder]: 107/544 cut-off events. [2022-01-19 10:24:43,912 INFO L130 PetriNetUnfolder]: For 1992/2087 co-relation queries the response was YES. [2022-01-19 10:24:43,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 544 events. 107/544 cut-off events. For 1992/2087 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2328 event pairs, 22 based on Foata normal form. 72/564 useless extension candidates. Maximal degree in co-relation 1465. Up to 79 conditions per place. [2022-01-19 10:24:43,913 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 183/183 dead transitions. [2022-01-19 10:24:43,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 183 transitions, 1120 flow [2022-01-19 10:24:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 10:24:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 10:24:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2022-01-19 10:24:43,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7795992714025501 [2022-01-19 10:24:43,914 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1284 transitions. [2022-01-19 10:24:43,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1284 transitions. [2022-01-19 10:24:43,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:24:43,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1284 transitions. [2022-01-19 10:24:43,916 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) [2022-01-19 10:24:43,917 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) [2022-01-19 10:24:43,917 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) [2022-01-19 10:24:43,917 INFO L186 Difference]: Start difference. First operand has 210 places, 169 transitions, 853 flow. Second operand 9 states and 1284 transitions. [2022-01-19 10:24:43,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 183 transitions, 1120 flow [2022-01-19 10:24:43,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 183 transitions, 1039 flow, removed 10 selfloop flow, removed 12 redundant places. [2022-01-19 10:24:43,921 INFO L242 Difference]: Finished difference. Result has 202 places, 0 transitions, 0 flow [2022-01-19 10:24:43,921 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=194, 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=202, PETRI_TRANSITIONS=0} [2022-01-19 10:24:43,921 INFO L334 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places. [2022-01-19 10:24:43,922 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 0 transitions, 0 flow [2022-01-19 10:24:43,922 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) [2022-01-19 10:24:43,923 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-19 10:24:43,924 INFO L764 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 10:24:43,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 10:24:43,926 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] [2022-01-19 10:24:43,928 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 10:24:43,929 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 10:24:43,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 10:24:43 BasicIcfg [2022-01-19 10:24:43,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 10:24:43,930 INFO L158 Benchmark]: Toolchain (without parser) took 22038.07ms. Allocated memory was 457.2MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 401.8MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 457.2MB. Free memory is still 419.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.48ms. Allocated memory was 457.2MB in the beginning and 589.3MB in the end (delta: 132.1MB). Free memory was 401.6MB in the beginning and 551.6MB in the end (delta: -150.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.08ms. Allocated memory is still 589.3MB. Free memory was 551.6MB in the beginning and 549.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 589.3MB. Free memory was 549.5MB in the beginning and 547.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: RCFGBuilder took 653.65ms. Allocated memory is still 589.3MB. Free memory was 547.4MB in the beginning and 510.7MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2022-01-19 10:24:43,931 INFO L158 Benchmark]: TraceAbstraction took 20843.19ms. Allocated memory was 589.3MB in the beginning and 5.6GB in the end (delta: 5.1GB). Free memory was 510.7MB in the beginning and 4.1GB in the end (delta: -3.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2022-01-19 10:24:43,932 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.10ms. Allocated memory is still 457.2MB. Free memory is still 419.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 424.48ms. Allocated memory was 457.2MB in the beginning and 589.3MB in the end (delta: 132.1MB). Free memory was 401.6MB in the beginning and 551.6MB in the end (delta: -150.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.08ms. Allocated memory is still 589.3MB. Free memory was 551.6MB in the beginning and 549.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 589.3MB. Free memory was 549.5MB in the beginning and 547.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 653.65ms. Allocated memory is still 589.3MB. Free memory was 547.4MB in the beginning and 510.7MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 20843.19ms. Allocated memory was 589.3MB in the beginning and 5.6GB in the end (delta: 5.1GB). Free memory was 510.7MB in the beginning and 4.1GB in the end (delta: -3.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * 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: 20.6s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2581 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2581 mSDsluCounter, 1621 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2938 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8155 IncrementalHoareTripleChecker+Invalid, 8759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 538 mSDtfsCounter, 8155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2859occurred in iteration=21, InterpolantAutomatonStates: 322, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2861 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2827 ConstructedInterpolants, 0 QuantifiedInterpolants, 15121 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! [2022-01-19 10:24:43,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...