./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/qrcu-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:01:54,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:01:54,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:01:54,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:01:54,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:01:54,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:01:54,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:01:54,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:01:54,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:01:54,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:01:54,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:01:54,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:01:54,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:01:54,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:01:54,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:01:54,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:01:54,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:01:54,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:01:54,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:01:54,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:01:54,882 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:01:54,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:01:54,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:01:54,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:01:54,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:01:54,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:01:54,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:01:54,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:01:54,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:01:54,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:01:54,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:01:54,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:01:54,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:01:54,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:01:54,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:01:54,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:01:54,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:01:54,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:01:54,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:01:54,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:01:54,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:01:54,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:01:54,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:01:54,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:01:54,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:01:54,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:01:54,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:01:54,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:01:54,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:01:54,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:01:54,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:01:54,924 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:01:54,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:01:54,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:01:54,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:01:54,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:01:54,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:01:54,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:01:54,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:01:54,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:01:54,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:01:54,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:01:54,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:01:54,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:01:54,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:01:54,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:01:54,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:01:54,928 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:01:54,938 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:01:54,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:01:54,938 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3655f01df3eccc3acdb69c97e41dec3a3ff24ca3333b88921cb12b5b6c342936 [2022-07-19 21:01:55,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:01:55,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:01:55,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:01:55,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:01:55,159 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:01:55,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2022-07-19 21:01:55,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5185e2a6/fb459b31d3ac468aaa66881c56df3a8b/FLAG3d028376d [2022-07-19 21:01:55,582 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:01:55,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2022-07-19 21:01:55,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5185e2a6/fb459b31d3ac468aaa66881c56df3a8b/FLAG3d028376d [2022-07-19 21:01:55,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5185e2a6/fb459b31d3ac468aaa66881c56df3a8b [2022-07-19 21:01:55,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:01:55,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:01:55,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:01:55,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:01:55,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:01:55,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:01:55" (1/1) ... [2022-07-19 21:01:55,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5667674c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:55, skipping insertion in model container [2022-07-19 21:01:55,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:01:55" (1/1) ... [2022-07-19 21:01:55,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:01:56,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:01:56,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2022-07-19 21:01:56,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2022-07-19 21:01:56,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:01:56,271 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:01:56,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2022-07-19 21:01:56,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2022-07-19 21:01:56,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:01:56,344 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:01:56,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56 WrapperNode [2022-07-19 21:01:56,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:01:56,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:01:56,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:01:56,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:01:56,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,394 INFO L137 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2022-07-19 21:01:56,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:01:56,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:01:56,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:01:56,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:01:56,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:01:56,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:01:56,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:01:56,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:01:56,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (1/1) ... [2022-07-19 21:01:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:01:56,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:01:56,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-07-19 21:01:56,501 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-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-07-19 21:01:56,554 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-07-19 21:01:56,554 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-07-19 21:01:56,554 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-07-19 21:01:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-19 21:01:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:01:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:01:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:01:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:01:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:01:56,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:01:56,556 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:01:56,709 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:01:56,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:01:56,942 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:01:57,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:01:57,039 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 21:01:57,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:01:57 BoogieIcfgContainer [2022-07-19 21:01:57,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:01:57,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:01:57,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:01:57,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:01:57,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:01:55" (1/3) ... [2022-07-19 21:01:57,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf7bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:01:57, skipping insertion in model container [2022-07-19 21:01:57,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:56" (2/3) ... [2022-07-19 21:01:57,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf7bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:01:57, skipping insertion in model container [2022-07-19 21:01:57,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:01:57" (3/3) ... [2022-07-19 21:01:57,048 INFO L111 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2022-07-19 21:01:57,053 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:01:57,059 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:01:57,059 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:01:57,059 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:01:57,197 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-19 21:01:57,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-07-19 21:01:57,292 INFO L129 PetriNetUnfolder]: 18/180 cut-off events. [2022-07-19 21:01:57,292 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:01:57,298 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 357 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-07-19 21:01:57,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-07-19 21:01:57,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2022-07-19 21:01:57,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:01:57,321 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79512a19, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cd6412e [2022-07-19 21:01:57,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-19 21:01:57,354 INFO L129 PetriNetUnfolder]: 9/123 cut-off events. [2022-07-19 21:01:57,354 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:01:57,354 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:01:57,355 INFO L200 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-07-19 21:01:57,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:01:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:01:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2022-07-19 21:01:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:01:57,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558512421] [2022-07-19 21:01:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:01:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:01:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:01:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:01:57,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:01:57,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558512421] [2022-07-19 21:01:57,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558512421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:01:57,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:01:57,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:01:57,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965623627] [2022-07-19 21:01:57,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:01:57,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:01:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:01:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:01:57,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:01:57,619 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2022-07-19 21:01:57,623 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-07-19 21:01:57,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:01:57,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2022-07-19 21:01:57,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:01:57,942 INFO L129 PetriNetUnfolder]: 629/1791 cut-off events. [2022-07-19 21:01:57,943 INFO L130 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-07-19 21:01:57,951 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 12276 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-07-19 21:01:57,961 INFO L132 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-07-19 21:01:57,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2022-07-19 21:01:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:01:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:01:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-07-19 21:01:57,975 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2022-07-19 21:01:57,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-07-19 21:01:57,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-07-19 21:01:57,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:01:57,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-07-19 21:01:57,985 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-07-19 21:01:57,991 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-07-19 21:01:57,992 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-07-19 21:01:57,993 INFO L186 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2022-07-19 21:01:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2022-07-19 21:01:57,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-19 21:01:58,005 INFO L242 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2022-07-19 21:01:58,007 INFO L262 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-07-19 21:01:58,010 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2022-07-19 21:01:58,010 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2022-07-19 21:01:58,011 INFO L496 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-07-19 21:01:58,011 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:01:58,011 INFO L200 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-07-19 21:01:58,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:01:58,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:01:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:01:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1151136919, now seen corresponding path program 1 times [2022-07-19 21:01:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:01:58,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886375039] [2022-07-19 21:01:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:01:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:01:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:01:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:01:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:01:58,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886375039] [2022-07-19 21:01:58,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886375039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:01:58,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:01:58,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:01:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658692112] [2022-07-19 21:01:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:01:58,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:01:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:01:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:01:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:01:58,106 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-07-19 21:01:58,107 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-07-19 21:01:58,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:01:58,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-07-19 21:01:58,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:01:58,248 INFO L129 PetriNetUnfolder]: 402/1255 cut-off events. [2022-07-19 21:01:58,248 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-07-19 21:01:58,253 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 8040 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-07-19 21:01:58,258 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-07-19 21:01:58,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2022-07-19 21:01:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:01:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:01:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-07-19 21:01:58,260 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-07-19 21:01:58,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-07-19 21:01:58,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-07-19 21:01:58,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:01:58,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-07-19 21:01:58,262 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-07-19 21:01:58,263 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-07-19 21:01:58,264 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-07-19 21:01:58,264 INFO L186 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2022-07-19 21:01:58,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2022-07-19 21:01:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:01:58,270 INFO L242 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2022-07-19 21:01:58,271 INFO L262 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-07-19 21:01:58,271 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2022-07-19 21:01:58,272 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2022-07-19 21:01:58,273 INFO L496 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-07-19 21:01:58,273 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:01:58,273 INFO L200 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-07-19 21:01:58,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:01:58,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:01:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:01:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1794772677, now seen corresponding path program 1 times [2022-07-19 21:01:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:01:58,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702774866] [2022-07-19 21:01:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:01:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:01:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:01:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:01:58,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:01:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702774866] [2022-07-19 21:01:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702774866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:01:58,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:01:58,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:01:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235541952] [2022-07-19 21:01:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:01:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:01:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:01:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:01:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:01:58,390 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:01:58,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-07-19 21:01:58,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:01:58,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:01:58,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:01:59,106 INFO L129 PetriNetUnfolder]: 2951/6671 cut-off events. [2022-07-19 21:01:59,106 INFO L130 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-07-19 21:01:59,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10975 conditions, 6671 events. 2951/6671 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 56588 event pairs, 405 based on Foata normal form. 0/6217 useless extension candidates. Maximal degree in co-relation 7824. Up to 1682 conditions per place. [2022-07-19 21:01:59,165 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 84 selfloop transitions, 11 changer transitions 7/227 dead transitions. [2022-07-19 21:01:59,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 695 flow [2022-07-19 21:01:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:01:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:01:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1070 transitions. [2022-07-19 21:01:59,168 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8352849336455894 [2022-07-19 21:01:59,169 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1070 transitions. [2022-07-19 21:01:59,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1070 transitions. [2022-07-19 21:01:59,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:01:59,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1070 transitions. [2022-07-19 21:01:59,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.85714285714286) internal successors, (1070), 7 states have internal predecessors, (1070), 0 states have call successors, (0), 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-07-19 21:01:59,173 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-07-19 21:01:59,173 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-07-19 21:01:59,174 INFO L186 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 7 states and 1070 transitions. [2022-07-19 21:01:59,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 695 flow [2022-07-19 21:01:59,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:01:59,181 INFO L242 Difference]: Finished difference. Result has 168 places, 172 transitions, 408 flow [2022-07-19 21:01:59,181 INFO L262 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=168, PETRI_TRANSITIONS=172} [2022-07-19 21:01:59,183 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2022-07-19 21:01:59,183 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 172 transitions, 408 flow [2022-07-19 21:01:59,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-07-19 21:01:59,183 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:01:59,184 INFO L200 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-07-19 21:01:59,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:01:59,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:01:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:01:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 54936445, now seen corresponding path program 1 times [2022-07-19 21:01:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:01:59,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679443538] [2022-07-19 21:01:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:01:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:01:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:01:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:01:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:01:59,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679443538] [2022-07-19 21:01:59,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679443538] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:01:59,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:01:59,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:01:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099062491] [2022-07-19 21:01:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:01:59,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:01:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:01:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:01:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:01:59,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-07-19 21:01:59,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 172 transitions, 408 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-07-19 21:01:59,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:01:59,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-07-19 21:01:59,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:01:59,758 INFO L129 PetriNetUnfolder]: 1220/3032 cut-off events. [2022-07-19 21:01:59,759 INFO L130 PetriNetUnfolder]: For 386/397 co-relation queries the response was YES. [2022-07-19 21:01:59,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 3032 events. 1220/3032 cut-off events. For 386/397 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24284 event pairs, 241 based on Foata normal form. 128/3023 useless extension candidates. Maximal degree in co-relation 5210. Up to 1544 conditions per place. [2022-07-19 21:01:59,780 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 95 selfloop transitions, 31 changer transitions 0/253 dead transitions. [2022-07-19 21:01:59,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 253 transitions, 868 flow [2022-07-19 21:01:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:01:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:01:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2022-07-19 21:01:59,783 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2022-07-19 21:01:59,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2022-07-19 21:01:59,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2022-07-19 21:01:59,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:01:59,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2022-07-19 21:01:59,786 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-07-19 21:01:59,788 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-07-19 21:01:59,789 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-07-19 21:01:59,789 INFO L186 Difference]: Start difference. First operand has 168 places, 172 transitions, 408 flow. Second operand 8 states and 1198 transitions. [2022-07-19 21:01:59,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 253 transitions, 868 flow [2022-07-19 21:01:59,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 253 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:01:59,795 INFO L242 Difference]: Finished difference. Result has 181 places, 205 transitions, 655 flow [2022-07-19 21:01:59,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=655, PETRI_PLACES=181, PETRI_TRANSITIONS=205} [2022-07-19 21:01:59,796 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 21 predicate places. [2022-07-19 21:01:59,796 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 205 transitions, 655 flow [2022-07-19 21:01:59,796 INFO L496 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-07-19 21:01:59,797 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:01:59,797 INFO L200 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-07-19 21:01:59,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:01:59,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:01:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:01:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 911682777, now seen corresponding path program 2 times [2022-07-19 21:01:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:01:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063151969] [2022-07-19 21:01:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:01:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:01:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:01:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:01:59,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:01:59,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063151969] [2022-07-19 21:01:59,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063151969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:01:59,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:01:59,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:01:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104088374] [2022-07-19 21:01:59,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:01:59,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:01:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:01:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:01:59,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:01:59,884 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2022-07-19 21:01:59,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 205 transitions, 655 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-07-19 21:01:59,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:01:59,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2022-07-19 21:01:59,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:00,603 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][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 102#L786-4true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 21#L739true, Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 92#L777true]) [2022-07-19 21:02:00,603 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2022-07-19 21:02:00,603 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-07-19 21:02:00,603 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-07-19 21:02:00,603 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-07-19 21:02:00,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][234], [111#L739-3true, 235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 102#L786-4true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 92#L777true, 204#true]) [2022-07-19 21:02:00,644 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-07-19 21:02:00,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-07-19 21:02:00,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-07-19 21:02:00,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-07-19 21:02:00,707 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][234], [235#(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: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 85#L787-1true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 21#L739true, Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 92#L777true]) [2022-07-19 21:02:00,707 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2022-07-19 21:02:00,707 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-07-19 21:02:00,707 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-07-19 21:02:00,708 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-07-19 21:02:00,781 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][234], [111#L739-3true, 235#(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: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), 85#L787-1true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 92#L777true, 204#true]) [2022-07-19 21:02:00,781 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-07-19 21:02:00,781 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-19 21:02:00,782 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-19 21:02:00,782 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-19 21:02:00,877 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][234], [235#(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: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 92#L777true, 204#true]) [2022-07-19 21:02:00,878 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is not cut-off event [2022-07-19 21:02:00,878 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-07-19 21:02:00,878 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-07-19 21:02:00,878 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is not cut-off event [2022-07-19 21:02:00,947 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][234], [120#L788-1true, 235#(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: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, 54#L758-3true, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 92#L777true]) [2022-07-19 21:02:00,948 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is not cut-off event [2022-07-19 21:02:00,948 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-07-19 21:02:00,948 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-07-19 21:02:00,948 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is not cut-off event [2022-07-19 21:02:01,091 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][234], [235#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem20#1| 0)), 88#L788-2true, Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 92#L777true, 204#true]) [2022-07-19 21:02:01,092 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2022-07-19 21:02:01,092 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-07-19 21:02:01,092 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-07-19 21:02:01,092 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2022-07-19 21:02:01,144 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][234], [72#L789-1true, 235#(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: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), qrcu_updaterThread1of1ForFork0InUse, Black: 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 186#(= ~readerprogress1~0 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 92#L777true]) [2022-07-19 21:02:01,144 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is not cut-off event [2022-07-19 21:02:01,145 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2022-07-19 21:02:01,145 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2022-07-19 21:02:01,145 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is not cut-off event [2022-07-19 21:02:01,270 INFO L129 PetriNetUnfolder]: 5633/11975 cut-off events. [2022-07-19 21:02:01,271 INFO L130 PetriNetUnfolder]: For 11615/11803 co-relation queries the response was YES. [2022-07-19 21:02:01,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28415 conditions, 11975 events. 5633/11975 cut-off events. For 11615/11803 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 111635 event pairs, 1142 based on Foata normal form. 142/11455 useless extension candidates. Maximal degree in co-relation 27823. Up to 3359 conditions per place. [2022-07-19 21:02:01,394 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 175 selfloop transitions, 18 changer transitions 10/335 dead transitions. [2022-07-19 21:02:01,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 335 transitions, 1649 flow [2022-07-19 21:02:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:02:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:02:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2022-07-19 21:02:01,397 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2022-07-19 21:02:01,397 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2022-07-19 21:02:01,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2022-07-19 21:02:01,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:01,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2022-07-19 21:02:01,401 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-07-19 21:02:01,403 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-07-19 21:02:01,404 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-07-19 21:02:01,404 INFO L186 Difference]: Start difference. First operand has 181 places, 205 transitions, 655 flow. Second operand 10 states and 1381 transitions. [2022-07-19 21:02:01,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 335 transitions, 1649 flow [2022-07-19 21:02:01,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 335 transitions, 1649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:01,451 INFO L242 Difference]: Finished difference. Result has 195 places, 221 transitions, 771 flow [2022-07-19 21:02:01,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=771, PETRI_PLACES=195, PETRI_TRANSITIONS=221} [2022-07-19 21:02:01,453 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 35 predicate places. [2022-07-19 21:02:01,453 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 221 transitions, 771 flow [2022-07-19 21:02:01,453 INFO L496 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-07-19 21:02:01,453 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:01,454 INFO L200 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-07-19 21:02:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:02:01,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:01,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2053644825, now seen corresponding path program 1 times [2022-07-19 21:02:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:01,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296362629] [2022-07-19 21:02:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296362629] [2022-07-19 21:02:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296362629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:01,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:01,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:02:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379585786] [2022-07-19 21:02:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:01,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:02:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:02:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:02:01,534 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-07-19 21:02:01,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 221 transitions, 771 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-07-19 21:02:01,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:01,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-07-19 21:02:01,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:02,246 INFO L129 PetriNetUnfolder]: 2049/5079 cut-off events. [2022-07-19 21:02:02,247 INFO L130 PetriNetUnfolder]: For 5450/5514 co-relation queries the response was YES. [2022-07-19 21:02:02,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 5079 events. 2049/5079 cut-off events. For 5450/5514 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 45420 event pairs, 226 based on Foata normal form. 97/4971 useless extension candidates. Maximal degree in co-relation 12429. Up to 1713 conditions per place. [2022-07-19 21:02:02,288 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 120 selfloop transitions, 37 changer transitions 0/298 dead transitions. [2022-07-19 21:02:02,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 298 transitions, 1417 flow [2022-07-19 21:02:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:02:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:02:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1468 transitions. [2022-07-19 21:02:02,293 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8021857923497268 [2022-07-19 21:02:02,293 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1468 transitions. [2022-07-19 21:02:02,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1468 transitions. [2022-07-19 21:02:02,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:02,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1468 transitions. [2022-07-19 21:02:02,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 146.8) internal successors, (1468), 10 states have internal predecessors, (1468), 0 states have call successors, (0), 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-07-19 21:02:02,298 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-07-19 21:02:02,299 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-07-19 21:02:02,299 INFO L186 Difference]: Start difference. First operand has 195 places, 221 transitions, 771 flow. Second operand 10 states and 1468 transitions. [2022-07-19 21:02:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 298 transitions, 1417 flow [2022-07-19 21:02:02,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 298 transitions, 1417 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:02,314 INFO L242 Difference]: Finished difference. Result has 209 places, 237 transitions, 1010 flow [2022-07-19 21:02:02,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1010, PETRI_PLACES=209, PETRI_TRANSITIONS=237} [2022-07-19 21:02:02,315 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2022-07-19 21:02:02,315 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 237 transitions, 1010 flow [2022-07-19 21:02:02,315 INFO L496 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-07-19 21:02:02,316 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:02,316 INFO L200 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-07-19 21:02:02,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:02:02,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 928253015, now seen corresponding path program 1 times [2022-07-19 21:02:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:02,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930372382] [2022-07-19 21:02:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930372382] [2022-07-19 21:02:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930372382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:02:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428462494] [2022-07-19 21:02:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:02:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:02,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:02:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:02:02,352 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-07-19 21:02:02,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 237 transitions, 1010 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-07-19 21:02:02,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:02,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-07-19 21:02:02,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:02,761 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][213], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 165#L771-3true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:02,761 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-07-19 21:02:02,761 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,762 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][212], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), 50#L772-2true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:02,762 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-07-19 21:02:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,762 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,839 INFO L382 tUnfolder$Statistics]: inserting event number 5 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][212], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 50#L772-2true, Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:02,839 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L382 tUnfolder$Statistics]: inserting event number 5 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][213], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 199#(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: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 165#L771-3true, Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:02,840 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-19 21:02:02,840 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,841 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,841 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:02,841 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:02,901 INFO L129 PetriNetUnfolder]: 1439/4562 cut-off events. [2022-07-19 21:02:02,901 INFO L130 PetriNetUnfolder]: For 5492/5750 co-relation queries the response was YES. [2022-07-19 21:02:02,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 4562 events. 1439/4562 cut-off events. For 5492/5750 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 43064 event pairs, 311 based on Foata normal form. 160/4405 useless extension candidates. Maximal degree in co-relation 10587. Up to 1193 conditions per place. [2022-07-19 21:02:02,945 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 73 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-07-19 21:02:02,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 258 transitions, 1286 flow [2022-07-19 21:02:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:02:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:02:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-07-19 21:02:02,947 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-07-19 21:02:02,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-07-19 21:02:02,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-07-19 21:02:02,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:02,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-07-19 21:02:02,948 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-07-19 21:02:02,949 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-07-19 21:02:02,949 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-07-19 21:02:02,949 INFO L186 Difference]: Start difference. First operand has 209 places, 237 transitions, 1010 flow. Second operand 3 states and 500 transitions. [2022-07-19 21:02:02,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 258 transitions, 1286 flow [2022-07-19 21:02:02,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 258 transitions, 1263 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:02:02,967 INFO L242 Difference]: Finished difference. Result has 208 places, 237 transitions, 994 flow [2022-07-19 21:02:02,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=205, 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=994, PETRI_PLACES=208, PETRI_TRANSITIONS=237} [2022-07-19 21:02:02,968 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2022-07-19 21:02:02,968 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 237 transitions, 994 flow [2022-07-19 21:02:02,969 INFO L496 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-07-19 21:02:02,969 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:02,969 INFO L200 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-07-19 21:02:02,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:02:02,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 545156572, now seen corresponding path program 1 times [2022-07-19 21:02:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:02,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592708839] [2022-07-19 21:02:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:03,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:03,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592708839] [2022-07-19 21:02:03,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592708839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:03,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:03,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:02:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701552702] [2022-07-19 21:02:03,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:02:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:02:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:02:03,004 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-07-19 21:02:03,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 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-07-19 21:02:03,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:03,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-07-19 21:02:03,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:03,490 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][212], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), 50#L772-2true, Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 272#(= ~readerprogress2~0 2), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:03,491 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-19 21:02:03,491 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:03,491 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:03,491 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:03,491 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][213], [Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 199#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 192#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0), Black: 191#(= ~readerprogress2~0 0), Black: 197#(and (= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart2~0#1.offset|) 0) (= ~readerprogress2~0 0) (= |qrcu_updaterThread1of1ForFork0_#t~mem21#1| 0)), 109#L787-2true, 54#L758-3true, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 165#L771-3true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), Black: 206#(= (+ (- 1) ~ctr1~0) 0), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 272#(= ~readerprogress2~0 2), 204#true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 231#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 221#true, Black: 186#(= ~readerprogress1~0 0)]) [2022-07-19 21:02:03,491 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-07-19 21:02:03,491 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:03,492 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:03,492 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-07-19 21:02:03,561 INFO L129 PetriNetUnfolder]: 1515/4859 cut-off events. [2022-07-19 21:02:03,561 INFO L130 PetriNetUnfolder]: For 5280/5543 co-relation queries the response was YES. [2022-07-19 21:02:03,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11319 conditions, 4859 events. 1515/4859 cut-off events. For 5280/5543 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 46821 event pairs, 203 based on Foata normal form. 107/4590 useless extension candidates. Maximal degree in co-relation 10970. Up to 1118 conditions per place. [2022-07-19 21:02:03,604 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-07-19 21:02:03,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 258 transitions, 1265 flow [2022-07-19 21:02:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:02:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:02:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-07-19 21:02:03,606 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-07-19 21:02:03,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-07-19 21:02:03,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-07-19 21:02:03,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:03,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-07-19 21:02:03,607 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-07-19 21:02:03,608 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-07-19 21:02:03,608 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-07-19 21:02:03,608 INFO L186 Difference]: Start difference. First operand has 208 places, 237 transitions, 994 flow. Second operand 3 states and 500 transitions. [2022-07-19 21:02:03,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 258 transitions, 1265 flow [2022-07-19 21:02:03,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 258 transitions, 1264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:02:03,625 INFO L242 Difference]: Finished difference. Result has 210 places, 237 transitions, 998 flow [2022-07-19 21:02:03,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=993, 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=998, PETRI_PLACES=210, PETRI_TRANSITIONS=237} [2022-07-19 21:02:03,626 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2022-07-19 21:02:03,626 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 237 transitions, 998 flow [2022-07-19 21:02:03,627 INFO L496 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-07-19 21:02:03,627 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:03,627 INFO L200 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-07-19 21:02:03,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:02:03,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1402509722, now seen corresponding path program 1 times [2022-07-19 21:02:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:03,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980455009] [2022-07-19 21:02:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:03,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980455009] [2022-07-19 21:02:03,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980455009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:03,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:03,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:02:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326363387] [2022-07-19 21:02:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:03,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:02:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:02:03,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:02:03,701 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-07-19 21:02:03,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 237 transitions, 998 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-07-19 21:02:03,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:03,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-07-19 21:02:03,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:04,372 INFO L129 PetriNetUnfolder]: 1766/5380 cut-off events. [2022-07-19 21:02:04,372 INFO L130 PetriNetUnfolder]: For 6303/6533 co-relation queries the response was YES. [2022-07-19 21:02:04,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12179 conditions, 5380 events. 1766/5380 cut-off events. For 6303/6533 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 50298 event pairs, 316 based on Foata normal form. 40/4971 useless extension candidates. Maximal degree in co-relation 11793. Up to 1261 conditions per place. [2022-07-19 21:02:04,420 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 49 selfloop transitions, 2 changer transitions 43/237 dead transitions. [2022-07-19 21:02:04,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 237 transitions, 1140 flow [2022-07-19 21:02:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:02:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:02:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-07-19 21:02:04,422 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8943533697632058 [2022-07-19 21:02:04,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-07-19 21:02:04,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-07-19 21:02:04,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:04,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-07-19 21:02:04,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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-07-19 21:02:04,424 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-07-19 21:02:04,425 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-07-19 21:02:04,425 INFO L186 Difference]: Start difference. First operand has 210 places, 237 transitions, 998 flow. Second operand 3 states and 491 transitions. [2022-07-19 21:02:04,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 237 transitions, 1140 flow [2022-07-19 21:02:04,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 237 transitions, 1131 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-07-19 21:02:04,442 INFO L242 Difference]: Finished difference. Result has 202 places, 181 transitions, 675 flow [2022-07-19 21:02:04,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=202, PETRI_TRANSITIONS=181} [2022-07-19 21:02:04,443 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places. [2022-07-19 21:02:04,443 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 181 transitions, 675 flow [2022-07-19 21:02:04,444 INFO L496 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-07-19 21:02:04,444 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:04,444 INFO L200 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-07-19 21:02:04,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:02:04,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2022-07-19 21:02:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:04,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031372340] [2022-07-19 21:02:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031372340] [2022-07-19 21:02:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031372340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:04,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:04,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:02:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141139408] [2022-07-19 21:02:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:02:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:02:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:02:04,486 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2022-07-19 21:02:04,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 181 transitions, 675 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-07-19 21:02:04,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:04,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2022-07-19 21:02:04,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:04,902 INFO L129 PetriNetUnfolder]: 887/2956 cut-off events. [2022-07-19 21:02:04,902 INFO L130 PetriNetUnfolder]: For 2616/2661 co-relation queries the response was YES. [2022-07-19 21:02:04,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 2956 events. 887/2956 cut-off events. For 2616/2661 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 26574 event pairs, 242 based on Foata normal form. 13/2798 useless extension candidates. Maximal degree in co-relation 6524. Up to 840 conditions per place. [2022-07-19 21:02:04,919 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 69 selfloop transitions, 25 changer transitions 5/236 dead transitions. [2022-07-19 21:02:04,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 236 transitions, 1146 flow [2022-07-19 21:02:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:02:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:02:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-07-19 21:02:04,922 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8727556596409055 [2022-07-19 21:02:04,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1118 transitions. [2022-07-19 21:02:04,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1118 transitions. [2022-07-19 21:02:04,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:04,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1118 transitions. [2022-07-19 21:02:04,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 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-07-19 21:02:04,927 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-07-19 21:02:04,927 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-07-19 21:02:04,927 INFO L186 Difference]: Start difference. First operand has 202 places, 181 transitions, 675 flow. Second operand 7 states and 1118 transitions. [2022-07-19 21:02:04,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 236 transitions, 1146 flow [2022-07-19 21:02:04,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 236 transitions, 1096 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-07-19 21:02:04,936 INFO L242 Difference]: Finished difference. Result has 193 places, 196 transitions, 847 flow [2022-07-19 21:02:04,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=193, PETRI_TRANSITIONS=196} [2022-07-19 21:02:04,937 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 33 predicate places. [2022-07-19 21:02:04,937 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 196 transitions, 847 flow [2022-07-19 21:02:04,937 INFO L496 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-07-19 21:02:04,937 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:04,937 INFO L200 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-07-19 21:02:04,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:02:04,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2048247070, now seen corresponding path program 1 times [2022-07-19 21:02:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595799250] [2022-07-19 21:02:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:04,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595799250] [2022-07-19 21:02:04,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595799250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:04,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:04,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:02:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345704982] [2022-07-19 21:02:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:04,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:02:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:02:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:02:04,963 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-07-19 21:02:04,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 196 transitions, 847 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-07-19 21:02:04,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:04,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-07-19 21:02:04,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:05,153 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, 189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), 102#L786-4true, Black: 191#(= ~readerprogress2~0 0), 54#L758-3true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), 272#(= ~readerprogress2~0 2), 204#true, Black: 281#(= ~ctr2~0 0), Black: 283#(<= 1 ~ctr2~0), Black: 282#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 287#(and (= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0) (<= 1 ~ctr2~0)), 80#L771-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 294#true, Black: 186#(= ~readerprogress1~0 0), 279#true]) [2022-07-19 21:02:05,153 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-07-19 21:02:05,154 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-19 21:02:05,154 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-07-19 21:02:05,154 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-07-19 21:02:05,198 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], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 191#(= ~readerprogress2~0 0), 109#L787-2true, 54#L758-3true, 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), 272#(= ~readerprogress2~0 2), 204#true, Black: 281#(= ~ctr2~0 0), Black: 283#(<= 1 ~ctr2~0), Black: 282#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 287#(and (= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0) (<= 1 ~ctr2~0)), 80#L771-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 294#true, Black: 186#(= ~readerprogress1~0 0), 279#true]) [2022-07-19 21:02:05,198 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-19 21:02:05,198 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-19 21:02:05,198 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-19 21:02:05,198 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-07-19 21:02:05,231 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], [189#true, Black: 248#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 244#true, Black: 254#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), 88#L788-2true, Black: 256#(and (<= 2 ~ctr1~0) (= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 0) (= ~ctr2~0 0)), Black: 191#(= ~readerprogress2~0 0), 250#(<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|), 180#(not (<= |qrcu_updaterThread1of1ForFork0_~sum~0#1| 1)), Black: 208#(and (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 213#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (<= 2 ~ctr1~0) (= ~ctr2~0 0)), Black: 207#(and (= ~ctr2~0 0) (= (+ (- 1) ~ctr1~0) 0)), 226#(= (select (select |#memory_int| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.offset|) 0), 272#(= ~readerprogress2~0 2), 204#true, Black: 281#(= ~ctr2~0 0), Black: 283#(<= 1 ~ctr2~0), Black: 282#(= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0), Black: 287#(and (= |qrcu_updaterThread1of1ForFork0_#t~post16#1| 0) (<= 1 ~ctr2~0)), 80#L771-1true, qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), Black: 235#(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: 224#(and (= (select |#valid| |qrcu_updaterThread1of1ForFork0_~#readerstart1~0#1.base|) 1) (= ~readerprogress1~0 0)), Black: 229#(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: 223#(= ~readerprogress1~0 0), Black: 178#true, 294#true, Black: 186#(= ~readerprogress1~0 0), 279#true]) [2022-07-19 21:02:05,231 INFO L384 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-07-19 21:02:05,232 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-19 21:02:05,232 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:05,232 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-07-19 21:02:05,250 INFO L129 PetriNetUnfolder]: 805/2891 cut-off events. [2022-07-19 21:02:05,251 INFO L130 PetriNetUnfolder]: For 4702/4780 co-relation queries the response was YES. [2022-07-19 21:02:05,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7111 conditions, 2891 events. 805/2891 cut-off events. For 4702/4780 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 25183 event pairs, 190 based on Foata normal form. 13/2761 useless extension candidates. Maximal degree in co-relation 6838. Up to 741 conditions per place. [2022-07-19 21:02:05,273 INFO L132 encePairwiseOnDemand]: 181/183 looper letters, 60 selfloop transitions, 1 changer transitions 2/210 dead transitions. [2022-07-19 21:02:05,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 210 transitions, 1079 flow [2022-07-19 21:02:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:02:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:02:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-07-19 21:02:05,275 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-07-19 21:02:05,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-07-19 21:02:05,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-07-19 21:02:05,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:05,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-07-19 21:02:05,277 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-07-19 21:02:05,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-07-19 21:02:05,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-07-19 21:02:05,278 INFO L186 Difference]: Start difference. First operand has 193 places, 196 transitions, 847 flow. Second operand 3 states and 488 transitions. [2022-07-19 21:02:05,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 210 transitions, 1079 flow [2022-07-19 21:02:05,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 210 transitions, 1073 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:05,289 INFO L242 Difference]: Finished difference. Result has 194 places, 193 transitions, 837 flow [2022-07-19 21:02:05,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=194, PETRI_TRANSITIONS=193} [2022-07-19 21:02:05,290 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 34 predicate places. [2022-07-19 21:02:05,290 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 193 transitions, 837 flow [2022-07-19 21:02:05,291 INFO L496 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-07-19 21:02:05,291 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:05,291 INFO L200 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-07-19 21:02:05,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:02:05,291 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1693078370, now seen corresponding path program 1 times [2022-07-19 21:02:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:05,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836976095] [2022-07-19 21:02:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836976095] [2022-07-19 21:02:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836976095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:05,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:05,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:02:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287065586] [2022-07-19 21:02:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:02:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:02:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:02:05,426 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:05,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 193 transitions, 837 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-07-19 21:02:05,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:05,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:05,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:06,144 INFO L129 PetriNetUnfolder]: 1864/4561 cut-off events. [2022-07-19 21:02:06,144 INFO L130 PetriNetUnfolder]: For 9546/9625 co-relation queries the response was YES. [2022-07-19 21:02:06,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13806 conditions, 4561 events. 1864/4561 cut-off events. For 9546/9625 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 38478 event pairs, 388 based on Foata normal form. 60/4501 useless extension candidates. Maximal degree in co-relation 13390. Up to 1855 conditions per place. [2022-07-19 21:02:06,182 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 133 selfloop transitions, 52 changer transitions 9/304 dead transitions. [2022-07-19 21:02:06,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 304 transitions, 1959 flow [2022-07-19 21:02:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:02:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:02:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1493 transitions. [2022-07-19 21:02:06,186 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.741679085941381 [2022-07-19 21:02:06,186 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1493 transitions. [2022-07-19 21:02:06,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1493 transitions. [2022-07-19 21:02:06,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:06,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1493 transitions. [2022-07-19 21:02:06,189 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-07-19 21:02:06,192 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-07-19 21:02:06,192 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-07-19 21:02:06,192 INFO L186 Difference]: Start difference. First operand has 194 places, 193 transitions, 837 flow. Second operand 11 states and 1493 transitions. [2022-07-19 21:02:06,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 304 transitions, 1959 flow [2022-07-19 21:02:06,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 304 transitions, 1958 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:02:06,219 INFO L242 Difference]: Finished difference. Result has 207 places, 223 transitions, 1342 flow [2022-07-19 21:02:06,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1342, PETRI_PLACES=207, PETRI_TRANSITIONS=223} [2022-07-19 21:02:06,219 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 47 predicate places. [2022-07-19 21:02:06,220 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 223 transitions, 1342 flow [2022-07-19 21:02:06,220 INFO L496 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-07-19 21:02:06,220 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:06,220 INFO L200 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-07-19 21:02:06,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 21:02:06,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 523705238, now seen corresponding path program 2 times [2022-07-19 21:02:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:06,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410780157] [2022-07-19 21:02:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:06,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410780157] [2022-07-19 21:02:06,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410780157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:06,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:06,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:02:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928795455] [2022-07-19 21:02:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:06,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:02:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:06,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:02:06,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:02:06,329 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:06,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 223 transitions, 1342 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-07-19 21:02:06,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:06,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:06,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:07,171 INFO L129 PetriNetUnfolder]: 1929/4784 cut-off events. [2022-07-19 21:02:07,171 INFO L130 PetriNetUnfolder]: For 14272/14353 co-relation queries the response was YES. [2022-07-19 21:02:07,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15895 conditions, 4784 events. 1929/4784 cut-off events. For 14272/14353 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 41093 event pairs, 452 based on Foata normal form. 66/4701 useless extension candidates. Maximal degree in co-relation 15435. Up to 1799 conditions per place. [2022-07-19 21:02:07,209 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 133 selfloop transitions, 75 changer transitions 33/351 dead transitions. [2022-07-19 21:02:07,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 351 transitions, 2826 flow [2022-07-19 21:02:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:02:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:02:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1753 transitions. [2022-07-19 21:02:07,213 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7368642286675073 [2022-07-19 21:02:07,213 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1753 transitions. [2022-07-19 21:02:07,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1753 transitions. [2022-07-19 21:02:07,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:07,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1753 transitions. [2022-07-19 21:02:07,217 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-07-19 21:02:07,219 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-07-19 21:02:07,220 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-07-19 21:02:07,220 INFO L186 Difference]: Start difference. First operand has 207 places, 223 transitions, 1342 flow. Second operand 13 states and 1753 transitions. [2022-07-19 21:02:07,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 351 transitions, 2826 flow [2022-07-19 21:02:07,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 351 transitions, 2749 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-07-19 21:02:07,263 INFO L242 Difference]: Finished difference. Result has 219 places, 243 transitions, 1773 flow [2022-07-19 21:02:07,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1773, PETRI_PLACES=219, PETRI_TRANSITIONS=243} [2022-07-19 21:02:07,264 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 59 predicate places. [2022-07-19 21:02:07,264 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 243 transitions, 1773 flow [2022-07-19 21:02:07,276 INFO L496 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-07-19 21:02:07,276 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:07,276 INFO L200 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-07-19 21:02:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 21:02:07,277 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash 131143178, now seen corresponding path program 1 times [2022-07-19 21:02:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:07,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53934236] [2022-07-19 21:02:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53934236] [2022-07-19 21:02:07,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53934236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:07,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:07,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:02:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279408847] [2022-07-19 21:02:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:07,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:02:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:02:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:02:07,410 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:07,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 243 transitions, 1773 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-07-19 21:02:07,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:07,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:07,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:08,262 INFO L129 PetriNetUnfolder]: 1659/4294 cut-off events. [2022-07-19 21:02:08,263 INFO L130 PetriNetUnfolder]: For 17339/17459 co-relation queries the response was YES. [2022-07-19 21:02:08,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14836 conditions, 4294 events. 1659/4294 cut-off events. For 17339/17459 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 37048 event pairs, 456 based on Foata normal form. 91/4239 useless extension candidates. Maximal degree in co-relation 14400. Up to 1720 conditions per place. [2022-07-19 21:02:08,293 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 143 selfloop transitions, 65 changer transitions 7/325 dead transitions. [2022-07-19 21:02:08,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 325 transitions, 2692 flow [2022-07-19 21:02:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:02:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-19 21:02:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1861 transitions. [2022-07-19 21:02:08,321 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7263856362217018 [2022-07-19 21:02:08,321 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1861 transitions. [2022-07-19 21:02:08,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1861 transitions. [2022-07-19 21:02:08,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:08,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1861 transitions. [2022-07-19 21:02:08,324 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-07-19 21:02:08,327 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-07-19 21:02:08,327 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-07-19 21:02:08,327 INFO L186 Difference]: Start difference. First operand has 219 places, 243 transitions, 1773 flow. Second operand 14 states and 1861 transitions. [2022-07-19 21:02:08,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 325 transitions, 2692 flow [2022-07-19 21:02:08,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 325 transitions, 2638 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-07-19 21:02:08,420 INFO L242 Difference]: Finished difference. Result has 232 places, 252 transitions, 1946 flow [2022-07-19 21:02:08,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1946, PETRI_PLACES=232, PETRI_TRANSITIONS=252} [2022-07-19 21:02:08,423 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 72 predicate places. [2022-07-19 21:02:08,439 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 252 transitions, 1946 flow [2022-07-19 21:02:08,440 INFO L496 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-07-19 21:02:08,440 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:08,440 INFO L200 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-07-19 21:02:08,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 21:02:08,440 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash 804789034, now seen corresponding path program 3 times [2022-07-19 21:02:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:08,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512500233] [2022-07-19 21:02:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512500233] [2022-07-19 21:02:08,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512500233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:08,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:08,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:02:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474001654] [2022-07-19 21:02:08,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:08,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:02:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:02:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:02:08,567 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:08,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 252 transitions, 1946 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-07-19 21:02:08,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:08,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:08,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:09,270 INFO L129 PetriNetUnfolder]: 1591/4144 cut-off events. [2022-07-19 21:02:09,271 INFO L130 PetriNetUnfolder]: For 17855/17994 co-relation queries the response was YES. [2022-07-19 21:02:09,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14437 conditions, 4144 events. 1591/4144 cut-off events. For 17855/17994 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 35697 event pairs, 427 based on Foata normal form. 119/4130 useless extension candidates. Maximal degree in co-relation 14034. Up to 1387 conditions per place. [2022-07-19 21:02:09,304 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 157 selfloop transitions, 74 changer transitions 14/355 dead transitions. [2022-07-19 21:02:09,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 355 transitions, 3115 flow [2022-07-19 21:02:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1633 transitions. [2022-07-19 21:02:09,308 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7436247723132969 [2022-07-19 21:02:09,308 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1633 transitions. [2022-07-19 21:02:09,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1633 transitions. [2022-07-19 21:02:09,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:09,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1633 transitions. [2022-07-19 21:02:09,311 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-07-19 21:02:09,313 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-07-19 21:02:09,313 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-07-19 21:02:09,313 INFO L186 Difference]: Start difference. First operand has 232 places, 252 transitions, 1946 flow. Second operand 12 states and 1633 transitions. [2022-07-19 21:02:09,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 355 transitions, 3115 flow [2022-07-19 21:02:09,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 355 transitions, 3050 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-19 21:02:09,360 INFO L242 Difference]: Finished difference. Result has 242 places, 260 transitions, 2212 flow [2022-07-19 21:02:09,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2212, PETRI_PLACES=242, PETRI_TRANSITIONS=260} [2022-07-19 21:02:09,361 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 82 predicate places. [2022-07-19 21:02:09,361 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 260 transitions, 2212 flow [2022-07-19 21:02:09,362 INFO L496 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-07-19 21:02:09,362 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:09,362 INFO L200 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-07-19 21:02:09,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 21:02:09,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 799660206, now seen corresponding path program 2 times [2022-07-19 21:02:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:09,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058994068] [2022-07-19 21:02:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:09,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-07-19 21:02:09,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:09,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058994068] [2022-07-19 21:02:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058994068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:09,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:09,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:02:09,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739943217] [2022-07-19 21:02:09,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:09,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:02:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:02:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:02:09,465 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:09,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 2212 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-07-19 21:02:09,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:09,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:09,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:10,283 INFO L129 PetriNetUnfolder]: 1564/4153 cut-off events. [2022-07-19 21:02:10,283 INFO L130 PetriNetUnfolder]: For 22151/22308 co-relation queries the response was YES. [2022-07-19 21:02:10,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14974 conditions, 4153 events. 1564/4153 cut-off events. For 22151/22308 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 36068 event pairs, 292 based on Foata normal form. 128/4149 useless extension candidates. Maximal degree in co-relation 14582. Up to 796 conditions per place. [2022-07-19 21:02:10,317 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 159 selfloop transitions, 76 changer transitions 28/373 dead transitions. [2022-07-19 21:02:10,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 373 transitions, 3508 flow [2022-07-19 21:02:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:02:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:02:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2145 transitions. [2022-07-19 21:02:10,319 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7325819672131147 [2022-07-19 21:02:10,319 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2145 transitions. [2022-07-19 21:02:10,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2145 transitions. [2022-07-19 21:02:10,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:10,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2145 transitions. [2022-07-19 21:02:10,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0625) internal successors, (2145), 16 states have internal predecessors, (2145), 0 states have call successors, (0), 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-07-19 21:02:10,325 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-07-19 21:02:10,325 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-07-19 21:02:10,326 INFO L186 Difference]: Start difference. First operand has 242 places, 260 transitions, 2212 flow. Second operand 16 states and 2145 transitions. [2022-07-19 21:02:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 373 transitions, 3508 flow [2022-07-19 21:02:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 373 transitions, 3401 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-07-19 21:02:10,390 INFO L242 Difference]: Finished difference. Result has 257 places, 263 transitions, 2379 flow [2022-07-19 21:02:10,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2379, PETRI_PLACES=257, PETRI_TRANSITIONS=263} [2022-07-19 21:02:10,391 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 97 predicate places. [2022-07-19 21:02:10,391 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 263 transitions, 2379 flow [2022-07-19 21:02:10,391 INFO L496 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-07-19 21:02:10,392 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:10,392 INFO L200 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-07-19 21:02:10,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 21:02:10,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash 327729458, now seen corresponding path program 3 times [2022-07-19 21:02:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:10,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704826979] [2022-07-19 21:02:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:10,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:10,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704826979] [2022-07-19 21:02:10,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704826979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:10,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:10,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:02:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60484075] [2022-07-19 21:02:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:10,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:02:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:02:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:02:10,501 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:10,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 263 transitions, 2379 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-07-19 21:02:10,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:10,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:10,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:11,279 INFO L129 PetriNetUnfolder]: 1510/4005 cut-off events. [2022-07-19 21:02:11,280 INFO L130 PetriNetUnfolder]: For 24662/24782 co-relation queries the response was YES. [2022-07-19 21:02:11,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14738 conditions, 4005 events. 1510/4005 cut-off events. For 24662/24782 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 34643 event pairs, 429 based on Foata normal form. 99/3970 useless extension candidates. Maximal degree in co-relation 14420. Up to 1439 conditions per place. [2022-07-19 21:02:11,308 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 138 selfloop transitions, 82 changer transitions 7/337 dead transitions. [2022-07-19 21:02:11,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 337 transitions, 3271 flow [2022-07-19 21:02:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:02:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:02:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2108 transitions. [2022-07-19 21:02:11,311 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7199453551912568 [2022-07-19 21:02:11,311 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2108 transitions. [2022-07-19 21:02:11,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2108 transitions. [2022-07-19 21:02:11,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:11,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2108 transitions. [2022-07-19 21:02:11,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 131.75) internal successors, (2108), 16 states have internal predecessors, (2108), 0 states have call successors, (0), 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-07-19 21:02:11,318 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-07-19 21:02:11,319 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-07-19 21:02:11,319 INFO L186 Difference]: Start difference. First operand has 257 places, 263 transitions, 2379 flow. Second operand 16 states and 2108 transitions. [2022-07-19 21:02:11,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 337 transitions, 3271 flow [2022-07-19 21:02:11,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 337 transitions, 3183 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-07-19 21:02:11,389 INFO L242 Difference]: Finished difference. Result has 268 places, 267 transitions, 2534 flow [2022-07-19 21:02:11,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2534, PETRI_PLACES=268, PETRI_TRANSITIONS=267} [2022-07-19 21:02:11,389 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2022-07-19 21:02:11,390 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 267 transitions, 2534 flow [2022-07-19 21:02:11,390 INFO L496 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-07-19 21:02:11,390 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:11,390 INFO L200 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-07-19 21:02:11,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 21:02:11,390 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 724432640, now seen corresponding path program 1 times [2022-07-19 21:02:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:11,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624548177] [2022-07-19 21:02:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:11,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:11,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624548177] [2022-07-19 21:02:11,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624548177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:11,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:11,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:02:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630989601] [2022-07-19 21:02:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:11,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:02:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:02:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:02:11,509 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:11,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 267 transitions, 2534 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-07-19 21:02:11,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:11,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:11,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:12,231 INFO L129 PetriNetUnfolder]: 1488/4058 cut-off events. [2022-07-19 21:02:12,231 INFO L130 PetriNetUnfolder]: For 27735/27847 co-relation queries the response was YES. [2022-07-19 21:02:12,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15095 conditions, 4058 events. 1488/4058 cut-off events. For 27735/27847 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 34873 event pairs, 160 based on Foata normal form. 124/4053 useless extension candidates. Maximal degree in co-relation 14789. Up to 994 conditions per place. [2022-07-19 21:02:12,266 INFO L132 encePairwiseOnDemand]: 166/183 looper letters, 175 selfloop transitions, 65 changer transitions 36/386 dead transitions. [2022-07-19 21:02:12,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 386 transitions, 4047 flow [2022-07-19 21:02:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2022-07-19 21:02:12,268 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2022-07-19 21:02:12,268 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2022-07-19 21:02:12,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2022-07-19 21:02:12,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:12,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2022-07-19 21:02:12,270 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-07-19 21:02:12,272 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-07-19 21:02:12,272 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-07-19 21:02:12,272 INFO L186 Difference]: Start difference. First operand has 268 places, 267 transitions, 2534 flow. Second operand 12 states and 1639 transitions. [2022-07-19 21:02:12,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 386 transitions, 4047 flow [2022-07-19 21:02:12,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 386 transitions, 3877 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-07-19 21:02:12,344 INFO L242 Difference]: Finished difference. Result has 275 places, 275 transitions, 2698 flow [2022-07-19 21:02:12,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2698, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2022-07-19 21:02:12,345 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2022-07-19 21:02:12,345 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 2698 flow [2022-07-19 21:02:12,346 INFO L496 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-07-19 21:02:12,346 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:12,346 INFO L200 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-07-19 21:02:12,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 21:02:12,346 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 399981210, now seen corresponding path program 1 times [2022-07-19 21:02:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:12,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300531855] [2022-07-19 21:02:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300531855] [2022-07-19 21:02:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300531855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:12,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:12,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:02:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218630274] [2022-07-19 21:02:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:12,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:02:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:02:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:02:12,493 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:12,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 2698 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-07-19 21:02:12,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:12,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:12,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:13,304 INFO L129 PetriNetUnfolder]: 1256/3667 cut-off events. [2022-07-19 21:02:13,305 INFO L130 PetriNetUnfolder]: For 29670/29782 co-relation queries the response was YES. [2022-07-19 21:02:13,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14376 conditions, 3667 events. 1256/3667 cut-off events. For 29670/29782 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 31813 event pairs, 128 based on Foata normal form. 115/3662 useless extension candidates. Maximal degree in co-relation 14064. Up to 537 conditions per place. [2022-07-19 21:02:13,340 INFO L132 encePairwiseOnDemand]: 162/183 looper letters, 162 selfloop transitions, 76 changer transitions 36/384 dead transitions. [2022-07-19 21:02:13,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 384 transitions, 4022 flow [2022-07-19 21:02:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:02:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:02:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2146 transitions. [2022-07-19 21:02:13,342 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7329234972677595 [2022-07-19 21:02:13,342 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2146 transitions. [2022-07-19 21:02:13,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2146 transitions. [2022-07-19 21:02:13,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:13,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2146 transitions. [2022-07-19 21:02:13,345 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-07-19 21:02:13,361 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-07-19 21:02:13,362 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-07-19 21:02:13,362 INFO L186 Difference]: Start difference. First operand has 275 places, 275 transitions, 2698 flow. Second operand 16 states and 2146 transitions. [2022-07-19 21:02:13,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 384 transitions, 4022 flow [2022-07-19 21:02:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 384 transitions, 3858 flow, removed 40 selfloop flow, removed 5 redundant places. [2022-07-19 21:02:13,454 INFO L242 Difference]: Finished difference. Result has 289 places, 277 transitions, 2788 flow [2022-07-19 21:02:13,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2557, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2788, PETRI_PLACES=289, PETRI_TRANSITIONS=277} [2022-07-19 21:02:13,456 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 129 predicate places. [2022-07-19 21:02:13,456 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 277 transitions, 2788 flow [2022-07-19 21:02:13,456 INFO L496 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-07-19 21:02:13,456 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:13,457 INFO L200 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-07-19 21:02:13,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 21:02:13,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1076776630, now seen corresponding path program 2 times [2022-07-19 21:02:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:13,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143288142] [2022-07-19 21:02:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:13,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143288142] [2022-07-19 21:02:13,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143288142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:13,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:13,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:02:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333141196] [2022-07-19 21:02:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:13,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:02:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:02:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:02:13,621 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:13,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 277 transitions, 2788 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-07-19 21:02:13,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:13,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:13,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:14,323 INFO L129 PetriNetUnfolder]: 1179/3402 cut-off events. [2022-07-19 21:02:14,324 INFO L130 PetriNetUnfolder]: For 32410/32457 co-relation queries the response was YES. [2022-07-19 21:02:14,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13446 conditions, 3402 events. 1179/3402 cut-off events. For 32410/32457 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 28893 event pairs, 236 based on Foata normal form. 57/3338 useless extension candidates. Maximal degree in co-relation 13119. Up to 1010 conditions per place. [2022-07-19 21:02:14,352 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 157 selfloop transitions, 74 changer transitions 16/357 dead transitions. [2022-07-19 21:02:14,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 357 transitions, 3883 flow [2022-07-19 21:02:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2022-07-19 21:02:14,354 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2022-07-19 21:02:14,354 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2022-07-19 21:02:14,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2022-07-19 21:02:14,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:14,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2022-07-19 21:02:14,357 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-07-19 21:02:14,358 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-07-19 21:02:14,359 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-07-19 21:02:14,359 INFO L186 Difference]: Start difference. First operand has 289 places, 277 transitions, 2788 flow. Second operand 12 states and 1618 transitions. [2022-07-19 21:02:14,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 357 transitions, 3883 flow [2022-07-19 21:02:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 357 transitions, 3720 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-07-19 21:02:14,432 INFO L242 Difference]: Finished difference. Result has 293 places, 279 transitions, 2910 flow [2022-07-19 21:02:14,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2653, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2910, PETRI_PLACES=293, PETRI_TRANSITIONS=279} [2022-07-19 21:02:14,434 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 133 predicate places. [2022-07-19 21:02:14,434 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 279 transitions, 2910 flow [2022-07-19 21:02:14,434 INFO L496 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-07-19 21:02:14,434 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:14,434 INFO L200 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-07-19 21:02:14,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 21:02:14,435 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash -180520246, now seen corresponding path program 2 times [2022-07-19 21:02:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:14,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385105967] [2022-07-19 21:02:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385105967] [2022-07-19 21:02:14,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385105967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:14,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:14,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:02:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957791307] [2022-07-19 21:02:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:14,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:02:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:02:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:02:14,561 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-07-19 21:02:14,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 279 transitions, 2910 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-07-19 21:02:14,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:14,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-07-19 21:02:14,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:15,359 INFO L129 PetriNetUnfolder]: 1013/3084 cut-off events. [2022-07-19 21:02:15,359 INFO L130 PetriNetUnfolder]: For 31080/31196 co-relation queries the response was YES. [2022-07-19 21:02:15,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12225 conditions, 3084 events. 1013/3084 cut-off events. For 31080/31196 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 26083 event pairs, 167 based on Foata normal form. 108/3072 useless extension candidates. Maximal degree in co-relation 11945. Up to 828 conditions per place. [2022-07-19 21:02:15,393 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 147 selfloop transitions, 77 changer transitions 19/348 dead transitions. [2022-07-19 21:02:15,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 348 transitions, 3818 flow [2022-07-19 21:02:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:02:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-19 21:02:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1982 transitions. [2022-07-19 21:02:15,395 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.722040072859745 [2022-07-19 21:02:15,395 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1982 transitions. [2022-07-19 21:02:15,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1982 transitions. [2022-07-19 21:02:15,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:15,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1982 transitions. [2022-07-19 21:02:15,398 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-07-19 21:02:15,400 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-07-19 21:02:15,400 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-07-19 21:02:15,400 INFO L186 Difference]: Start difference. First operand has 293 places, 279 transitions, 2910 flow. Second operand 15 states and 1982 transitions. [2022-07-19 21:02:15,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 348 transitions, 3818 flow [2022-07-19 21:02:15,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 348 transitions, 3738 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-07-19 21:02:15,477 INFO L242 Difference]: Finished difference. Result has 299 places, 265 transitions, 2857 flow [2022-07-19 21:02:15,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2857, PETRI_PLACES=299, PETRI_TRANSITIONS=265} [2022-07-19 21:02:15,478 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 139 predicate places. [2022-07-19 21:02:15,478 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 265 transitions, 2857 flow [2022-07-19 21:02:15,479 INFO L496 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-07-19 21:02:15,480 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:15,480 INFO L200 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-07-19 21:02:15,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 21:02:15,480 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1185028197, now seen corresponding path program 1 times [2022-07-19 21:02:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:15,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725793017] [2022-07-19 21:02:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:15,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725793017] [2022-07-19 21:02:15,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725793017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:15,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:15,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235767427] [2022-07-19 21:02:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:15,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:15,554 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:15,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 265 transitions, 2857 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-07-19 21:02:15,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:15,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:15,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:16,033 INFO L129 PetriNetUnfolder]: 642/2286 cut-off events. [2022-07-19 21:02:16,034 INFO L130 PetriNetUnfolder]: For 21042/21082 co-relation queries the response was YES. [2022-07-19 21:02:16,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8633 conditions, 2286 events. 642/2286 cut-off events. For 21042/21082 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 18103 event pairs, 93 based on Foata normal form. 24/2240 useless extension candidates. Maximal degree in co-relation 8393. Up to 315 conditions per place. [2022-07-19 21:02:16,057 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 108 selfloop transitions, 37 changer transitions 60/340 dead transitions. [2022-07-19 21:02:16,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 340 transitions, 3843 flow [2022-07-19 21:02:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:02:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:02:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1633 transitions. [2022-07-19 21:02:16,059 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8112270243417784 [2022-07-19 21:02:16,059 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1633 transitions. [2022-07-19 21:02:16,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1633 transitions. [2022-07-19 21:02:16,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:16,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1633 transitions. [2022-07-19 21:02:16,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 148.45454545454547) internal successors, (1633), 11 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-07-19 21:02:16,062 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-07-19 21:02:16,063 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-07-19 21:02:16,063 INFO L186 Difference]: Start difference. First operand has 299 places, 265 transitions, 2857 flow. Second operand 11 states and 1633 transitions. [2022-07-19 21:02:16,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 340 transitions, 3843 flow [2022-07-19 21:02:16,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 340 transitions, 3512 flow, removed 31 selfloop flow, removed 20 redundant places. [2022-07-19 21:02:16,109 INFO L242 Difference]: Finished difference. Result has 287 places, 238 transitions, 2229 flow [2022-07-19 21:02:16,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2584, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2229, PETRI_PLACES=287, PETRI_TRANSITIONS=238} [2022-07-19 21:02:16,109 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2022-07-19 21:02:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 238 transitions, 2229 flow [2022-07-19 21:02:16,110 INFO L496 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-07-19 21:02:16,110 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:16,110 INFO L200 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-07-19 21:02:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 21:02:16,110 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -848613193, now seen corresponding path program 2 times [2022-07-19 21:02:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:16,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146166028] [2022-07-19 21:02:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146166028] [2022-07-19 21:02:16,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146166028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:16,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:16,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850085516] [2022-07-19 21:02:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:16,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:16,174 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:16,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 238 transitions, 2229 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-07-19 21:02:16,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:16,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:16,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:16,562 INFO L129 PetriNetUnfolder]: 559/1905 cut-off events. [2022-07-19 21:02:16,562 INFO L130 PetriNetUnfolder]: For 15355/15423 co-relation queries the response was YES. [2022-07-19 21:02:16,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 1905 events. 559/1905 cut-off events. For 15355/15423 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 14268 event pairs, 80 based on Foata normal form. 38/1862 useless extension candidates. Maximal degree in co-relation 6960. Up to 333 conditions per place. [2022-07-19 21:02:16,578 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 110 selfloop transitions, 45 changer transitions 27/317 dead transitions. [2022-07-19 21:02:16,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 317 transitions, 3294 flow [2022-07-19 21:02:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2022-07-19 21:02:16,580 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2022-07-19 21:02:16,581 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2022-07-19 21:02:16,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2022-07-19 21:02:16,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:16,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2022-07-19 21:02:16,583 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-07-19 21:02:16,584 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-07-19 21:02:16,584 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-07-19 21:02:16,584 INFO L186 Difference]: Start difference. First operand has 287 places, 238 transitions, 2229 flow. Second operand 12 states and 1769 transitions. [2022-07-19 21:02:16,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 317 transitions, 3294 flow [2022-07-19 21:02:16,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 317 transitions, 2902 flow, removed 48 selfloop flow, removed 29 redundant places. [2022-07-19 21:02:16,615 INFO L242 Difference]: Finished difference. Result has 275 places, 250 transitions, 2203 flow [2022-07-19 21:02:16,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1964, 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=2203, PETRI_PLACES=275, PETRI_TRANSITIONS=250} [2022-07-19 21:02:16,615 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 115 predicate places. [2022-07-19 21:02:16,616 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 250 transitions, 2203 flow [2022-07-19 21:02:16,616 INFO L496 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-07-19 21:02:16,616 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:16,616 INFO L200 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-07-19 21:02:16,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 21:02:16,616 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -373271357, now seen corresponding path program 3 times [2022-07-19 21:02:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:16,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472304818] [2022-07-19 21:02:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:16,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472304818] [2022-07-19 21:02:16,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472304818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:16,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:16,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711960807] [2022-07-19 21:02:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:16,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:16,680 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:16,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 250 transitions, 2203 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-07-19 21:02:16,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:16,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:16,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:17,015 INFO L129 PetriNetUnfolder]: 579/2074 cut-off events. [2022-07-19 21:02:17,016 INFO L130 PetriNetUnfolder]: For 13499/13584 co-relation queries the response was YES. [2022-07-19 21:02:17,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7176 conditions, 2074 events. 579/2074 cut-off events. For 13499/13584 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16172 event pairs, 89 based on Foata normal form. 59/2039 useless extension candidates. Maximal degree in co-relation 6640. Up to 322 conditions per place. [2022-07-19 21:02:17,032 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 105 selfloop transitions, 52 changer transitions 42/334 dead transitions. [2022-07-19 21:02:17,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 334 transitions, 3294 flow [2022-07-19 21:02:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1773 transitions. [2022-07-19 21:02:17,034 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8073770491803278 [2022-07-19 21:02:17,034 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1773 transitions. [2022-07-19 21:02:17,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1773 transitions. [2022-07-19 21:02:17,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:17,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1773 transitions. [2022-07-19 21:02:17,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.75) internal successors, (1773), 12 states have internal predecessors, (1773), 0 states have call successors, (0), 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-07-19 21:02:17,038 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-07-19 21:02:17,038 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-07-19 21:02:17,038 INFO L186 Difference]: Start difference. First operand has 275 places, 250 transitions, 2203 flow. Second operand 12 states and 1773 transitions. [2022-07-19 21:02:17,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 334 transitions, 3294 flow [2022-07-19 21:02:17,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 334 transitions, 3220 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-07-19 21:02:17,066 INFO L242 Difference]: Finished difference. Result has 287 places, 256 transitions, 2359 flow [2022-07-19 21:02:17,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=271, 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=2359, PETRI_PLACES=287, PETRI_TRANSITIONS=256} [2022-07-19 21:02:17,067 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2022-07-19 21:02:17,067 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 256 transitions, 2359 flow [2022-07-19 21:02:17,067 INFO L496 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-07-19 21:02:17,067 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:17,068 INFO L200 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-07-19 21:02:17,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 21:02:17,068 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1745939257, now seen corresponding path program 4 times [2022-07-19 21:02:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:17,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990816616] [2022-07-19 21:02:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:17,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-07-19 21:02:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990816616] [2022-07-19 21:02:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990816616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:17,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:17,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:02:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357082914] [2022-07-19 21:02:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:17,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:02:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:02:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:02:17,097 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-07-19 21:02:17,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 256 transitions, 2359 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-07-19 21:02:17,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:17,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-07-19 21:02:17,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:17,337 INFO L129 PetriNetUnfolder]: 458/2031 cut-off events. [2022-07-19 21:02:17,337 INFO L130 PetriNetUnfolder]: For 15436/15532 co-relation queries the response was YES. [2022-07-19 21:02:17,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 2031 events. 458/2031 cut-off events. For 15436/15532 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 16352 event pairs, 107 based on Foata normal form. 51/1967 useless extension candidates. Maximal degree in co-relation 6708. Up to 380 conditions per place. [2022-07-19 21:02:17,353 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 93 selfloop transitions, 10 changer transitions 7/279 dead transitions. [2022-07-19 21:02:17,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 279 transitions, 2798 flow [2022-07-19 21:02:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 21:02:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-19 21:02:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2022-07-19 21:02:17,354 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2022-07-19 21:02:17,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2022-07-19 21:02:17,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2022-07-19 21:02:17,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:17,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2022-07-19 21:02:17,355 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-07-19 21:02:17,356 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-07-19 21:02:17,356 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-07-19 21:02:17,356 INFO L186 Difference]: Start difference. First operand has 287 places, 256 transitions, 2359 flow. Second operand 4 states and 643 transitions. [2022-07-19 21:02:17,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 279 transitions, 2798 flow [2022-07-19 21:02:17,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 2674 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-07-19 21:02:17,387 INFO L242 Difference]: Finished difference. Result has 284 places, 255 transitions, 2275 flow [2022-07-19 21:02:17,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=279, 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=2275, PETRI_PLACES=284, PETRI_TRANSITIONS=255} [2022-07-19 21:02:17,387 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 124 predicate places. [2022-07-19 21:02:17,387 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 255 transitions, 2275 flow [2022-07-19 21:02:17,388 INFO L496 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-07-19 21:02:17,388 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:17,388 INFO L200 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-07-19 21:02:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 21:02:17,388 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1448459419, now seen corresponding path program 5 times [2022-07-19 21:02:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:17,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80982276] [2022-07-19 21:02:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:17,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80982276] [2022-07-19 21:02:17,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80982276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:17,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:17,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:17,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001520655] [2022-07-19 21:02:17,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:17,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:17,449 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:17,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 255 transitions, 2275 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-07-19 21:02:17,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:17,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:17,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:17,838 INFO L129 PetriNetUnfolder]: 535/2116 cut-off events. [2022-07-19 21:02:17,838 INFO L130 PetriNetUnfolder]: For 15302/15465 co-relation queries the response was YES. [2022-07-19 21:02:17,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7433 conditions, 2116 events. 535/2116 cut-off events. For 15302/15465 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 16927 event pairs, 96 based on Foata normal form. 100/2108 useless extension candidates. Maximal degree in co-relation 7162. Up to 305 conditions per place. [2022-07-19 21:02:17,855 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 100 selfloop transitions, 52 changer transitions 50/337 dead transitions. [2022-07-19 21:02:17,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 337 transitions, 3472 flow [2022-07-19 21:02:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:02:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-19 21:02:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2052 transitions. [2022-07-19 21:02:17,857 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8009367681498829 [2022-07-19 21:02:17,857 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2052 transitions. [2022-07-19 21:02:17,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2052 transitions. [2022-07-19 21:02:17,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:17,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2052 transitions. [2022-07-19 21:02:17,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.57142857142858) internal successors, (2052), 14 states have internal predecessors, (2052), 0 states have call successors, (0), 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-07-19 21:02:17,861 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-07-19 21:02:17,861 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-07-19 21:02:17,861 INFO L186 Difference]: Start difference. First operand has 284 places, 255 transitions, 2275 flow. Second operand 14 states and 2052 transitions. [2022-07-19 21:02:17,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 337 transitions, 3472 flow [2022-07-19 21:02:17,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 337 transitions, 3400 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-07-19 21:02:17,893 INFO L242 Difference]: Finished difference. Result has 299 places, 255 transitions, 2431 flow [2022-07-19 21:02:17,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=279, 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=2431, PETRI_PLACES=299, PETRI_TRANSITIONS=255} [2022-07-19 21:02:17,894 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 139 predicate places. [2022-07-19 21:02:17,894 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 255 transitions, 2431 flow [2022-07-19 21:02:17,894 INFO L496 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-07-19 21:02:17,894 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:17,895 INFO L200 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-07-19 21:02:17,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 21:02:17,895 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2093478427, now seen corresponding path program 1 times [2022-07-19 21:02:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:17,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923842244] [2022-07-19 21:02:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:17,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923842244] [2022-07-19 21:02:17,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923842244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:17,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:17,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764544031] [2022-07-19 21:02:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:17,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:17,953 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:17,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 255 transitions, 2431 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-07-19 21:02:17,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:17,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:17,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:18,316 INFO L129 PetriNetUnfolder]: 461/1923 cut-off events. [2022-07-19 21:02:18,317 INFO L130 PetriNetUnfolder]: For 16276/16448 co-relation queries the response was YES. [2022-07-19 21:02:18,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7106 conditions, 1923 events. 461/1923 cut-off events. For 16276/16448 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 14829 event pairs, 91 based on Foata normal form. 112/1934 useless extension candidates. Maximal degree in co-relation 6766. Up to 284 conditions per place. [2022-07-19 21:02:18,329 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 92 selfloop transitions, 39 changer transitions 47/304 dead transitions. [2022-07-19 21:02:18,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 304 transitions, 3211 flow [2022-07-19 21:02:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:02:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:02:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1605 transitions. [2022-07-19 21:02:18,337 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.797317436661699 [2022-07-19 21:02:18,337 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1605 transitions. [2022-07-19 21:02:18,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1605 transitions. [2022-07-19 21:02:18,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:18,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1605 transitions. [2022-07-19 21:02:18,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.9090909090909) internal successors, (1605), 11 states have internal predecessors, (1605), 0 states have call successors, (0), 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-07-19 21:02:18,345 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-07-19 21:02:18,345 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-07-19 21:02:18,345 INFO L186 Difference]: Start difference. First operand has 299 places, 255 transitions, 2431 flow. Second operand 11 states and 1605 transitions. [2022-07-19 21:02:18,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 304 transitions, 3211 flow [2022-07-19 21:02:18,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 304 transitions, 3080 flow, removed 15 selfloop flow, removed 13 redundant places. [2022-07-19 21:02:18,377 INFO L242 Difference]: Finished difference. Result has 298 places, 229 transitions, 1957 flow [2022-07-19 21:02:18,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2309, 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=1957, PETRI_PLACES=298, PETRI_TRANSITIONS=229} [2022-07-19 21:02:18,382 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 138 predicate places. [2022-07-19 21:02:18,382 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 229 transitions, 1957 flow [2022-07-19 21:02:18,383 INFO L496 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-07-19 21:02:18,383 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:18,383 INFO L200 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-07-19 21:02:18,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 21:02:18,383 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -733823789, now seen corresponding path program 2 times [2022-07-19 21:02:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688757775] [2022-07-19 21:02:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:18,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688757775] [2022-07-19 21:02:18,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688757775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:18,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:18,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799104678] [2022-07-19 21:02:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:18,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:18,484 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:18,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 229 transitions, 1957 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-07-19 21:02:18,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:18,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:18,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:18,771 INFO L129 PetriNetUnfolder]: 319/1457 cut-off events. [2022-07-19 21:02:18,771 INFO L130 PetriNetUnfolder]: For 10135/10271 co-relation queries the response was YES. [2022-07-19 21:02:18,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 1457 events. 319/1457 cut-off events. For 10135/10271 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10346 event pairs, 53 based on Foata normal form. 111/1477 useless extension candidates. Maximal degree in co-relation 4852. Up to 148 conditions per place. [2022-07-19 21:02:18,784 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 93 selfloop transitions, 42 changer transitions 37/291 dead transitions. [2022-07-19 21:02:18,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 291 transitions, 2936 flow [2022-07-19 21:02:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1754 transitions. [2022-07-19 21:02:18,786 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7987249544626593 [2022-07-19 21:02:18,786 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1754 transitions. [2022-07-19 21:02:18,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1754 transitions. [2022-07-19 21:02:18,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:18,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1754 transitions. [2022-07-19 21:02:18,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 146.16666666666666) internal successors, (1754), 12 states have internal predecessors, (1754), 0 states have call successors, (0), 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-07-19 21:02:18,790 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-07-19 21:02:18,790 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-07-19 21:02:18,790 INFO L186 Difference]: Start difference. First operand has 298 places, 229 transitions, 1957 flow. Second operand 12 states and 1754 transitions. [2022-07-19 21:02:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 291 transitions, 2936 flow [2022-07-19 21:02:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 2463 flow, removed 35 selfloop flow, removed 36 redundant places. [2022-07-19 21:02:18,813 INFO L242 Difference]: Finished difference. Result has 277 places, 226 transitions, 1753 flow [2022-07-19 21:02:18,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=259, 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=12, PETRI_FLOW=1753, PETRI_PLACES=277, PETRI_TRANSITIONS=226} [2022-07-19 21:02:18,814 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 117 predicate places. [2022-07-19 21:02:18,814 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 226 transitions, 1753 flow [2022-07-19 21:02:18,814 INFO L496 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-07-19 21:02:18,815 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:18,815 INFO L200 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-07-19 21:02:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 21:02:18,815 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 483175112, now seen corresponding path program 1 times [2022-07-19 21:02:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569494859] [2022-07-19 21:02:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569494859] [2022-07-19 21:02:18,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569494859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:18,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:18,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788639441] [2022-07-19 21:02:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:18,876 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:18,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 226 transitions, 1753 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-07-19 21:02:18,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:18,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:18,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:19,094 INFO L129 PetriNetUnfolder]: 235/1082 cut-off events. [2022-07-19 21:02:19,095 INFO L130 PetriNetUnfolder]: For 5529/5658 co-relation queries the response was YES. [2022-07-19 21:02:19,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 1082 events. 235/1082 cut-off events. For 5529/5658 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6727 event pairs, 52 based on Foata normal form. 99/1095 useless extension candidates. Maximal degree in co-relation 3482. Up to 140 conditions per place. [2022-07-19 21:02:19,102 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 46 selfloop transitions, 19 changer transitions 83/254 dead transitions. [2022-07-19 21:02:19,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 254 transitions, 2280 flow [2022-07-19 21:02:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:02:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:02:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1447 transitions. [2022-07-19 21:02:19,104 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7907103825136612 [2022-07-19 21:02:19,104 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1447 transitions. [2022-07-19 21:02:19,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1447 transitions. [2022-07-19 21:02:19,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:19,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1447 transitions. [2022-07-19 21:02:19,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.7) internal successors, (1447), 10 states have internal predecessors, (1447), 0 states have call successors, (0), 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-07-19 21:02:19,107 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-07-19 21:02:19,107 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-07-19 21:02:19,107 INFO L186 Difference]: Start difference. First operand has 277 places, 226 transitions, 1753 flow. Second operand 10 states and 1447 transitions. [2022-07-19 21:02:19,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 254 transitions, 2280 flow [2022-07-19 21:02:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 254 transitions, 2162 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-07-19 21:02:19,124 INFO L242 Difference]: Finished difference. Result has 270 places, 162 transitions, 932 flow [2022-07-19 21:02:19,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=260, 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=932, PETRI_PLACES=270, PETRI_TRANSITIONS=162} [2022-07-19 21:02:19,124 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 110 predicate places. [2022-07-19 21:02:19,125 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 162 transitions, 932 flow [2022-07-19 21:02:19,125 INFO L496 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-07-19 21:02:19,125 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:19,125 INFO L200 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-07-19 21:02:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 21:02:19,125 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1868277023, now seen corresponding path program 3 times [2022-07-19 21:02:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:19,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82648253] [2022-07-19 21:02:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:19,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82648253] [2022-07-19 21:02:19,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82648253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:19,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:19,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593456067] [2022-07-19 21:02:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:19,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:19,185 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:19,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 162 transitions, 932 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-07-19 21:02:19,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:19,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:19,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:19,372 INFO L129 PetriNetUnfolder]: 151/724 cut-off events. [2022-07-19 21:02:19,372 INFO L130 PetriNetUnfolder]: For 3114/3143 co-relation queries the response was YES. [2022-07-19 21:02:19,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 724 events. 151/724 cut-off events. For 3114/3143 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3906 event pairs, 46 based on Foata normal form. 15/682 useless extension candidates. Maximal degree in co-relation 2158. Up to 84 conditions per place. [2022-07-19 21:02:19,377 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 44 selfloop transitions, 24 changer transitions 30/204 dead transitions. [2022-07-19 21:02:19,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 204 transitions, 1483 flow [2022-07-19 21:02:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:02:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-19 21:02:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2008 transitions. [2022-07-19 21:02:19,379 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7837626854020296 [2022-07-19 21:02:19,379 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2008 transitions. [2022-07-19 21:02:19,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2008 transitions. [2022-07-19 21:02:19,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:19,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2008 transitions. [2022-07-19 21:02:19,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 143.42857142857142) internal successors, (2008), 14 states have internal predecessors, (2008), 0 states have call successors, (0), 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-07-19 21:02:19,382 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-07-19 21:02:19,383 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-07-19 21:02:19,383 INFO L186 Difference]: Start difference. First operand has 270 places, 162 transitions, 932 flow. Second operand 14 states and 2008 transitions. [2022-07-19 21:02:19,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 204 transitions, 1483 flow [2022-07-19 21:02:19,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 204 transitions, 1102 flow, removed 21 selfloop flow, removed 59 redundant places. [2022-07-19 21:02:19,390 INFO L242 Difference]: Finished difference. Result has 203 places, 162 transitions, 739 flow [2022-07-19 21:02:19,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=739, PETRI_PLACES=203, PETRI_TRANSITIONS=162} [2022-07-19 21:02:19,391 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 43 predicate places. [2022-07-19 21:02:19,391 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 162 transitions, 739 flow [2022-07-19 21:02:19,391 INFO L496 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-07-19 21:02:19,391 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:19,391 INFO L200 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-07-19 21:02:19,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 21:02:19,392 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash 90273215, now seen corresponding path program 4 times [2022-07-19 21:02:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:19,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188717438] [2022-07-19 21:02:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:02:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:19,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188717438] [2022-07-19 21:02:19,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188717438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:19,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:19,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:02:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039936053] [2022-07-19 21:02:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:02:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:02:19,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:02:19,421 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-07-19 21:02:19,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 162 transitions, 739 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-07-19 21:02:19,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:19,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-07-19 21:02:19,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:19,487 INFO L129 PetriNetUnfolder]: 101/583 cut-off events. [2022-07-19 21:02:19,487 INFO L130 PetriNetUnfolder]: For 1984/2008 co-relation queries the response was YES. [2022-07-19 21:02:19,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 583 events. 101/583 cut-off events. For 1984/2008 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2746 event pairs, 31 based on Foata normal form. 17/547 useless extension candidates. Maximal degree in co-relation 1456. Up to 84 conditions per place. [2022-07-19 21:02:19,491 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 35 selfloop transitions, 8 changer transitions 2/168 dead transitions. [2022-07-19 21:02:19,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 168 transitions, 876 flow [2022-07-19 21:02:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 21:02:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-19 21:02:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-07-19 21:02:19,492 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2022-07-19 21:02:19,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2022-07-19 21:02:19,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2022-07-19 21:02:19,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:19,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2022-07-19 21:02:19,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 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-07-19 21:02:19,494 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-07-19 21:02:19,494 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-07-19 21:02:19,494 INFO L186 Difference]: Start difference. First operand has 203 places, 162 transitions, 739 flow. Second operand 4 states and 628 transitions. [2022-07-19 21:02:19,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 168 transitions, 876 flow [2022-07-19 21:02:19,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 168 transitions, 762 flow, removed 21 selfloop flow, removed 14 redundant places. [2022-07-19 21:02:19,499 INFO L242 Difference]: Finished difference. Result has 190 places, 162 transitions, 668 flow [2022-07-19 21:02:19,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=668, PETRI_PLACES=190, PETRI_TRANSITIONS=162} [2022-07-19 21:02:19,500 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 30 predicate places. [2022-07-19 21:02:19,500 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 162 transitions, 668 flow [2022-07-19 21:02:19,500 INFO L496 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-07-19 21:02:19,500 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:19,500 INFO L200 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-07-19 21:02:19,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 21:02:19,500 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-19 21:02:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2045095045, now seen corresponding path program 1 times [2022-07-19 21:02:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:19,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223842292] [2022-07-19 21:02:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:19,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-07-19 21:02:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:19,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223842292] [2022-07-19 21:02:19,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223842292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:19,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:19,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:02:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554393672] [2022-07-19 21:02:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:19,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:02:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:02:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:02:19,559 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-07-19 21:02:19,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 162 transitions, 668 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-07-19 21:02:19,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:19,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-07-19 21:02:19,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:19,662 INFO L129 PetriNetUnfolder]: 111/563 cut-off events. [2022-07-19 21:02:19,662 INFO L130 PetriNetUnfolder]: For 1852/1879 co-relation queries the response was YES. [2022-07-19 21:02:19,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 563 events. 111/563 cut-off events. For 1852/1879 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2581 event pairs, 24 based on Foata normal form. 20/531 useless extension candidates. Maximal degree in co-relation 1415. Up to 79 conditions per place. [2022-07-19 21:02:19,664 INFO L132 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 178/178 dead transitions. [2022-07-19 21:02:19,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 178 transitions, 937 flow [2022-07-19 21:02:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:02:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:02:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1287 transitions. [2022-07-19 21:02:19,666 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7814207650273224 [2022-07-19 21:02:19,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1287 transitions. [2022-07-19 21:02:19,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1287 transitions. [2022-07-19 21:02:19,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:19,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1287 transitions. [2022-07-19 21:02:19,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.0) internal successors, (1287), 9 states have internal predecessors, (1287), 0 states have call successors, (0), 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-07-19 21:02:19,668 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-07-19 21:02:19,669 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-07-19 21:02:19,669 INFO L186 Difference]: Start difference. First operand has 190 places, 162 transitions, 668 flow. Second operand 9 states and 1287 transitions. [2022-07-19 21:02:19,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 178 transitions, 937 flow [2022-07-19 21:02:19,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 178 transitions, 914 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-19 21:02:19,673 INFO L242 Difference]: Finished difference. Result has 194 places, 0 transitions, 0 flow [2022-07-19 21:02:19,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=194, PETRI_TRANSITIONS=0} [2022-07-19 21:02:19,673 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 34 predicate places. [2022-07-19 21:02:19,674 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 0 transitions, 0 flow [2022-07-19 21:02:19,674 INFO L496 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-07-19 21:02:19,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-19 21:02:19,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-19 21:02:19,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-19 21:02:19,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-19 21:02:19,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-19 21:02:19,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-07-19 21:02:19,677 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-19 21:02:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 21:02:19,678 INFO L356 BasicCegarLoop]: Path program histogram: [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:02:19,681 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:02:19,681 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:02:19,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:02:19 BasicIcfg [2022-07-19 21:02:19,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:02:19,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:02:19,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:02:19,684 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:02:19,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:01:57" (3/4) ... [2022-07-19 21:02:19,686 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 21:02:19,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2022-07-19 21:02:19,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2022-07-19 21:02:19,689 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2022-07-19 21:02:19,691 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-19 21:02:19,691 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-19 21:02:19,691 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 21:02:19,691 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 21:02:19,708 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:02:19,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:02:19,709 INFO L158 Benchmark]: Toolchain (without parser) took 23734.23ms. Allocated memory was 88.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 50.3MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 803.4MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,709 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:02:19,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.46ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 50.1MB in the beginning and 99.5MB in the end (delta: -49.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.39ms. Allocated memory is still 125.8MB. Free memory was 99.5MB in the beginning and 96.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,710 INFO L158 Benchmark]: Boogie Preprocessor took 52.27ms. Allocated memory is still 125.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,710 INFO L158 Benchmark]: RCFGBuilder took 589.45ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 61.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,710 INFO L158 Benchmark]: TraceAbstraction took 22641.58ms. Allocated memory was 125.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 60.7MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 773.4MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,710 INFO L158 Benchmark]: Witness Printer took 24.63ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:02:19,711 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.18ms. Allocated memory is still 88.1MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.46ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 50.1MB in the beginning and 99.5MB in the end (delta: -49.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.39ms. Allocated memory is still 125.8MB. Free memory was 99.5MB in the beginning and 96.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.27ms. Allocated memory is still 125.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.45ms. Allocated memory is still 125.8MB. Free memory was 94.7MB in the beginning and 61.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22641.58ms. Allocated memory was 125.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 60.7MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 773.4MB. Max. memory is 16.1GB. * Witness Printer took 24.63ms. Allocated memory is still 2.8GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 22.5s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2508 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2508 mSDsluCounter, 1595 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2902 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8026 IncrementalHoareTripleChecker+Invalid, 8614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 520 mSDtfsCounter, 8026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2910occurred in iteration=20, InterpolantAutomatonStates: 310, 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, 2690 NumberOfCodeBlocks, 2690 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2658 ConstructedInterpolants, 0 QuantifiedInterpolants, 14393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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-07-19 21:02:19,736 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE