./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/qrcu-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:32:05,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:32:05,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:32:06,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:32:06,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:32:06,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:32:06,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:32:06,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:32:06,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:32:06,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:32:06,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:32:06,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:32:06,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:32:06,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:32:06,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:32:06,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:32:06,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:32:06,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:32:06,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:32:06,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:32:06,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:32:06,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:32:06,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:32:06,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:32:06,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:32:06,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:32:06,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:32:06,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:32:06,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:32:06,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:32:06,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:32:06,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:32:06,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:32:06,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:32:06,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:32:06,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:32:06,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:32:06,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:32:06,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:32:06,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:32:06,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:32:06,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:32:06,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:32:06,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:32:06,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:32:06,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:32:06,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:32:06,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:32:06,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:32:06,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:32:06,191 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:32:06,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:32:06,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:32:06,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:32:06,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:32:06,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:32:06,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:32:06,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:32:06,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:32:06,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:32:06,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:32:06,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:32:06,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:32:06,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:32:06,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:32:06,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:32:06,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:06,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:32:06,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:32:06,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:32:06,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:32:06,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:32:06,198 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:32:06,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:32:06,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:32:06,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc 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-11-02 20:32:06,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:32:06,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:32:06,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:32:06,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:32:06,669 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:32:06,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/qrcu-1.i [2022-11-02 20:32:06,765 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/data/2591589a0/af021c82837c452e8cfe606d4c49d0ad/FLAGef17813da [2022-11-02 20:32:07,485 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:32:07,490 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/sv-benchmarks/c/pthread-atomic/qrcu-1.i [2022-11-02 20:32:07,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/data/2591589a0/af021c82837c452e8cfe606d4c49d0ad/FLAGef17813da [2022-11-02 20:32:07,746 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/data/2591589a0/af021c82837c452e8cfe606d4c49d0ad [2022-11-02 20:32:07,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:32:07,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:32:07,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:07,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:32:07,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:32:07,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:07" (1/1) ... [2022-11-02 20:32:07,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e97044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:07, skipping insertion in model container [2022-11-02 20:32:07,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:07" (1/1) ... [2022-11-02 20:32:07,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:32:07,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:32:08,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2022-11-02 20:32:08,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2022-11-02 20:32:08,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:08,330 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:32:08,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30694,30707] [2022-11-02 20:32:08,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/sv-benchmarks/c/pthread-atomic/qrcu-1.i[30916,30929] [2022-11-02 20:32:08,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:08,482 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:32:08,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08 WrapperNode [2022-11-02 20:32:08,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:08,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:08,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:32:08,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:32:08,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,587 INFO L138 Inliner]: procedures = 177, calls = 54, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 270 [2022-11-02 20:32:08,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:08,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:32:08,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:32:08,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:32:08,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:32:08,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:32:08,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:32:08,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:32:08,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:08,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:32:08,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:32:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader1 [2022-11-02 20:32:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader1 [2022-11-02 20:32:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_reader2 [2022-11-02 20:32:08,788 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_reader2 [2022-11-02 20:32:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:32:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:32:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure qrcu_updater [2022-11-02 20:32:08,790 INFO L138 BoogieDeclarations]: Found implementation of procedure qrcu_updater [2022-11-02 20:32:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:32:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:32:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:32:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:32:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:32:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:32:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:32:08,794 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:32:09,090 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:32:09,094 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:32:09,676 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:32:09,889 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:32:09,890 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:32:09,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:09 BoogieIcfgContainer [2022-11-02 20:32:09,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:32:09,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:32:09,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:32:09,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:32:09,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:32:07" (1/3) ... [2022-11-02 20:32:09,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc3d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:09, skipping insertion in model container [2022-11-02 20:32:09,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (2/3) ... [2022-11-02 20:32:09,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc3d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:09, skipping insertion in model container [2022-11-02 20:32:09,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:09" (3/3) ... [2022-11-02 20:32:09,906 INFO L112 eAbstractionObserver]: Analyzing ICFG qrcu-1.i [2022-11-02 20:32:09,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:32:09,934 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:32:09,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:32:09,934 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:32:10,090 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:32:10,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-11-02 20:32:10,270 INFO L130 PetriNetUnfolder]: 18/180 cut-off events. [2022-11-02 20:32:10,270 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:32:10,276 INFO L83 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 355 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-11-02 20:32:10,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-11-02 20:32:10,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 351 flow [2022-11-02 20:32:10,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:32:10,300 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ab0de41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:32:10,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:32:10,336 INFO L130 PetriNetUnfolder]: 9/122 cut-off events. [2022-11-02 20:32:10,336 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:32:10,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:10,337 INFO L208 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-11-02 20:32:10,338 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-11-02 20:32:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -707274187, now seen corresponding path program 1 times [2022-11-02 20:32:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:10,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222019515] [2022-11-02 20:32:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:10,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222019515] [2022-11-02 20:32:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222019515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:10,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:10,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116053088] [2022-11-02 20:32:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:10,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:10,886 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2022-11-02 20:32:10,891 INFO L100 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-11-02 20:32:10,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:10,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2022-11-02 20:32:10,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:11,633 INFO L130 PetriNetUnfolder]: 629/1791 cut-off events. [2022-11-02 20:32:11,634 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-11-02 20:32:11,648 INFO L83 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 12377 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-11-02 20:32:11,663 INFO L137 encePairwiseOnDemand]: 174/183 looper letters, 40 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-02 20:32:11,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 455 flow [2022-11-02 20:32:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-11-02 20:32:11,693 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8998178506375227 [2022-11-02 20:32:11,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-11-02 20:32:11,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-11-02 20:32:11,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:11,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-11-02 20:32:11,711 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-11-02 20:32:11,720 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-11-02 20:32:11,721 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-11-02 20:32:11,724 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 351 flow. Second operand 3 states and 494 transitions. [2022-11-02 20:32:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 455 flow [2022-11-02 20:32:11,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 442 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:11,747 INFO L231 Difference]: Finished difference. Result has 159 places, 163 transitions, 344 flow [2022-11-02 20:32:11,750 INFO L270 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-11-02 20:32:11,757 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, -1 predicate places. [2022-11-02 20:32:11,757 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 163 transitions, 344 flow [2022-11-02 20:32:11,758 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-11-02 20:32:11,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:11,759 INFO L208 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-11-02 20:32:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:32:11,760 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-11-02 20:32:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash -234050775, now seen corresponding path program 1 times [2022-11-02 20:32:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:11,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575166339] [2022-11-02 20:32:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575166339] [2022-11-02 20:32:12,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575166339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:12,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:12,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612871636] [2022-11-02 20:32:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:12,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:12,211 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-11-02 20:32:12,244 INFO L100 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-11-02 20:32:12,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:12,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-11-02 20:32:12,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:12,669 INFO L130 PetriNetUnfolder]: 402/1255 cut-off events. [2022-11-02 20:32:12,670 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-11-02 20:32:12,678 INFO L83 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 8065 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-11-02 20:32:12,687 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 26 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-02 20:32:12,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 172 transitions, 421 flow [2022-11-02 20:32:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-02 20:32:12,691 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-11-02 20:32:12,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-02 20:32:12,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-02 20:32:12,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:12,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-02 20:32:12,694 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-11-02 20:32:12,697 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-11-02 20:32:12,698 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-11-02 20:32:12,698 INFO L175 Difference]: Start difference. First operand has 159 places, 163 transitions, 344 flow. Second operand 3 states and 500 transitions. [2022-11-02 20:32:12,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 172 transitions, 421 flow [2022-11-02 20:32:12,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 172 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:32:12,708 INFO L231 Difference]: Finished difference. Result has 161 places, 163 transitions, 350 flow [2022-11-02 20:32:12,709 INFO L270 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-11-02 20:32:12,710 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2022-11-02 20:32:12,711 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 350 flow [2022-11-02 20:32:12,713 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-11-02 20:32:12,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:12,714 INFO L208 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-11-02 20:32:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:32:12,715 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-11-02 20:32:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1675792571, now seen corresponding path program 1 times [2022-11-02 20:32:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:12,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542291888] [2022-11-02 20:32:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:13,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542291888] [2022-11-02 20:32:13,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542291888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:13,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:13,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888077831] [2022-11-02 20:32:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:13,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:13,299 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:13,301 INFO L100 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-11-02 20:32:13,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:13,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:13,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:15,104 INFO L130 PetriNetUnfolder]: 2951/6671 cut-off events. [2022-11-02 20:32:15,105 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-11-02 20:32:15,143 INFO L83 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 56577 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-11-02 20:32:15,176 INFO L137 encePairwiseOnDemand]: 176/183 looper letters, 84 selfloop transitions, 11 changer transitions 7/227 dead transitions. [2022-11-02 20:32:15,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 695 flow [2022-11-02 20:32:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:32:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1070 transitions. [2022-11-02 20:32:15,181 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8352849336455894 [2022-11-02 20:32:15,181 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1070 transitions. [2022-11-02 20:32:15,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1070 transitions. [2022-11-02 20:32:15,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:15,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1070 transitions. [2022-11-02 20:32:15,186 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-11-02 20:32:15,189 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-11-02 20:32:15,191 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-11-02 20:32:15,191 INFO L175 Difference]: Start difference. First operand has 161 places, 163 transitions, 350 flow. Second operand 7 states and 1070 transitions. [2022-11-02 20:32:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 695 flow [2022-11-02 20:32:15,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:32:15,202 INFO L231 Difference]: Finished difference. Result has 168 places, 172 transitions, 408 flow [2022-11-02 20:32:15,203 INFO L270 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-11-02 20:32:15,204 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2022-11-02 20:32:15,204 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 172 transitions, 408 flow [2022-11-02 20:32:15,205 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-11-02 20:32:15,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:15,206 INFO L208 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-11-02 20:32:15,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:32:15,206 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-11-02 20:32:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 972022589, now seen corresponding path program 1 times [2022-11-02 20:32:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:15,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284119887] [2022-11-02 20:32:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:15,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284119887] [2022-11-02 20:32:15,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284119887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:15,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:15,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867762365] [2022-11-02 20:32:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:32:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:32:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:15,542 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-11-02 20:32:15,544 INFO L100 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-11-02 20:32:15,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:15,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-11-02 20:32:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:16,553 INFO L130 PetriNetUnfolder]: 1220/3041 cut-off events. [2022-11-02 20:32:16,554 INFO L131 PetriNetUnfolder]: For 393/404 co-relation queries the response was YES. [2022-11-02 20:32:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 3041 events. 1220/3041 cut-off events. For 393/404 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24283 event pairs, 229 based on Foata normal form. 128/3035 useless extension candidates. Maximal degree in co-relation 5219. Up to 1544 conditions per place. [2022-11-02 20:32:16,599 INFO L137 encePairwiseOnDemand]: 165/183 looper letters, 95 selfloop transitions, 31 changer transitions 0/253 dead transitions. [2022-11-02 20:32:16,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 253 transitions, 868 flow [2022-11-02 20:32:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:32:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:32:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1198 transitions. [2022-11-02 20:32:16,605 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8183060109289617 [2022-11-02 20:32:16,606 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1198 transitions. [2022-11-02 20:32:16,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1198 transitions. [2022-11-02 20:32:16,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:16,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1198 transitions. [2022-11-02 20:32:16,617 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-11-02 20:32:16,622 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-11-02 20:32:16,623 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-11-02 20:32:16,624 INFO L175 Difference]: Start difference. First operand has 168 places, 172 transitions, 408 flow. Second operand 8 states and 1198 transitions. [2022-11-02 20:32:16,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 253 transitions, 868 flow [2022-11-02 20:32:16,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 253 transitions, 868 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:32:16,637 INFO L231 Difference]: Finished difference. Result has 181 places, 205 transitions, 655 flow [2022-11-02 20:32:16,637 INFO L270 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-11-02 20:32:16,638 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 21 predicate places. [2022-11-02 20:32:16,639 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 205 transitions, 655 flow [2022-11-02 20:32:16,639 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-11-02 20:32:16,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:16,640 INFO L208 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-11-02 20:32:16,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:32:16,641 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-11-02 20:32:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1305771671, now seen corresponding path program 1 times [2022-11-02 20:32:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:16,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192000048] [2022-11-02 20:32:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192000048] [2022-11-02 20:32:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192000048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:17,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688003398] [2022-11-02 20:32:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:32:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:32:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:17,255 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183 [2022-11-02 20:32:17,257 INFO L100 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-11-02 20:32:17,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:17,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183 [2022-11-02 20:32:17,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:19,626 INFO L381 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) (= ~ctr1~0 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true, 92#L777true]) [2022-11-02 20:32:19,627 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-02 20:32:19,627 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 20:32:19,627 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 20:32:19,627 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 20:32:19,880 INFO L381 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) (= ~ctr1~0 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true, 92#L777true]) [2022-11-02 20:32:19,881 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-02 20:32:19,881 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 20:32:19,882 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 20:32:19,882 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 20:32:20,124 INFO L381 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) (= ~ctr1~0 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true, 92#L777true]) [2022-11-02 20:32:20,125 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-02 20:32:20,125 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-02 20:32:20,125 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-02 20:32:20,126 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-02 20:32:20,236 INFO L381 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) (= ~ctr1~0 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), Black: 186#(= ~readerprogress1~0 0), 204#true, 92#L777true]) [2022-11-02 20:32:20,237 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 20:32:20,237 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:20,237 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:20,238 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:20,440 INFO L130 PetriNetUnfolder]: 5691/12091 cut-off events. [2022-11-02 20:32:20,440 INFO L131 PetriNetUnfolder]: For 11654/11838 co-relation queries the response was YES. [2022-11-02 20:32:20,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28727 conditions, 12091 events. 5691/12091 cut-off events. For 11654/11838 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 112679 event pairs, 1155 based on Foata normal form. 144/11570 useless extension candidates. Maximal degree in co-relation 28135. Up to 3377 conditions per place. [2022-11-02 20:32:20,626 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 175 selfloop transitions, 18 changer transitions 10/335 dead transitions. [2022-11-02 20:32:20,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 335 transitions, 1649 flow [2022-11-02 20:32:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:32:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:32:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1381 transitions. [2022-11-02 20:32:20,632 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7546448087431694 [2022-11-02 20:32:20,633 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1381 transitions. [2022-11-02 20:32:20,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1381 transitions. [2022-11-02 20:32:20,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:20,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1381 transitions. [2022-11-02 20:32:20,640 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-11-02 20:32:20,645 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-11-02 20:32:20,646 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-11-02 20:32:20,647 INFO L175 Difference]: Start difference. First operand has 181 places, 205 transitions, 655 flow. Second operand 10 states and 1381 transitions. [2022-11-02 20:32:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 335 transitions, 1649 flow [2022-11-02 20:32:20,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 335 transitions, 1649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:32:20,722 INFO L231 Difference]: Finished difference. Result has 195 places, 221 transitions, 771 flow [2022-11-02 20:32:20,723 INFO L270 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-11-02 20:32:20,727 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 35 predicate places. [2022-11-02 20:32:20,729 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 221 transitions, 771 flow [2022-11-02 20:32:20,730 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-11-02 20:32:20,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:20,730 INFO L208 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-11-02 20:32:20,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:32:20,731 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-11-02 20:32:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash -593304133, now seen corresponding path program 1 times [2022-11-02 20:32:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:20,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242866579] [2022-11-02 20:32:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:21,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242866579] [2022-11-02 20:32:21,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242866579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:21,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:32:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79350549] [2022-11-02 20:32:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:21,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:32:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:32:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:21,044 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2022-11-02 20:32:21,046 INFO L100 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-11-02 20:32:21,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:21,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2022-11-02 20:32:21,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:22,678 INFO L130 PetriNetUnfolder]: 2049/5079 cut-off events. [2022-11-02 20:32:22,678 INFO L131 PetriNetUnfolder]: For 5416/5480 co-relation queries the response was YES. [2022-11-02 20:32:22,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12640 conditions, 5079 events. 2049/5079 cut-off events. For 5416/5480 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 45389 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-11-02 20:32:22,766 INFO L137 encePairwiseOnDemand]: 162/183 looper letters, 120 selfloop transitions, 37 changer transitions 0/298 dead transitions. [2022-11-02 20:32:22,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 298 transitions, 1417 flow [2022-11-02 20:32:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:32:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:32:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1468 transitions. [2022-11-02 20:32:22,772 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8021857923497268 [2022-11-02 20:32:22,772 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1468 transitions. [2022-11-02 20:32:22,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1468 transitions. [2022-11-02 20:32:22,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:22,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1468 transitions. [2022-11-02 20:32:22,778 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-11-02 20:32:22,782 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-11-02 20:32:22,784 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-11-02 20:32:22,784 INFO L175 Difference]: Start difference. First operand has 195 places, 221 transitions, 771 flow. Second operand 10 states and 1468 transitions. [2022-11-02 20:32:22,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 298 transitions, 1417 flow [2022-11-02 20:32:22,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 298 transitions, 1417 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:32:22,814 INFO L231 Difference]: Finished difference. Result has 209 places, 237 transitions, 1010 flow [2022-11-02 20:32:22,815 INFO L270 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-11-02 20:32:22,816 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 49 predicate places. [2022-11-02 20:32:22,816 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 237 transitions, 1010 flow [2022-11-02 20:32:22,817 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-11-02 20:32:22,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:22,818 INFO L208 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-11-02 20:32:22,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:32:22,818 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-11-02 20:32:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1229532137, now seen corresponding path program 1 times [2022-11-02 20:32:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395601073] [2022-11-02 20:32:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:22,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395601073] [2022-11-02 20:32:22,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395601073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:22,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:22,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32798409] [2022-11-02 20:32:22,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:22,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:22,973 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-11-02 20:32:22,974 INFO L100 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-11-02 20:32:22,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:22,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-11-02 20:32:22,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:23,701 INFO L381 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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:23,702 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-02 20:32:23,702 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,702 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,702 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,703 INFO L381 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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:23,703 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-02 20:32:23,703 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,703 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,704 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,883 INFO L381 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)), 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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:23,883 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:23,883 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,883 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,884 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 20:32:23,884 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,885 INFO L381 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)), 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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:23,885 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:23,885 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,885 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:23,885 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 20:32:23,886 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:24,031 INFO L130 PetriNetUnfolder]: 1439/4562 cut-off events. [2022-11-02 20:32:24,031 INFO L131 PetriNetUnfolder]: For 5492/5750 co-relation queries the response was YES. [2022-11-02 20:32:24,095 INFO L83 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 43045 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-11-02 20:32:24,128 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 73 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-11-02 20:32:24,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 258 transitions, 1286 flow [2022-11-02 20:32:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-02 20:32:24,131 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-11-02 20:32:24,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-02 20:32:24,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-02 20:32:24,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:24,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-02 20:32:24,140 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-11-02 20:32:24,143 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-11-02 20:32:24,143 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-11-02 20:32:24,144 INFO L175 Difference]: Start difference. First operand has 209 places, 237 transitions, 1010 flow. Second operand 3 states and 500 transitions. [2022-11-02 20:32:24,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 258 transitions, 1286 flow [2022-11-02 20:32:24,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 258 transitions, 1263 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:32:24,179 INFO L231 Difference]: Finished difference. Result has 208 places, 237 transitions, 994 flow [2022-11-02 20:32:24,179 INFO L270 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-11-02 20:32:24,180 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2022-11-02 20:32:24,181 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 237 transitions, 994 flow [2022-11-02 20:32:24,182 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-11-02 20:32:24,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:24,182 INFO L208 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-11-02 20:32:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:32:24,183 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-11-02 20:32:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 545156572, now seen corresponding path program 1 times [2022-11-02 20:32:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:24,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367118722] [2022-11-02 20:32:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367118722] [2022-11-02 20:32:24,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367118722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:24,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172714900] [2022-11-02 20:32:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:24,372 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183 [2022-11-02 20:32:24,373 INFO L100 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-11-02 20:32:24,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:24,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183 [2022-11-02 20:32:24,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:25,289 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][176], [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, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 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)), 128#L777-3true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 270#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, 28#L757true, Black: 186#(= ~readerprogress1~0 0)]) [2022-11-02 20:32:25,290 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,290 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,290 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,290 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:25,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([839] L777-->L777-3: Formula: (and (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3| |v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|) (= |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4| |v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|)) InVars {qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|} OutVars{qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, qrcu_updaterThread1of1ForFork0_#t~mem20#1=|v_qrcu_updaterThread1of1ForFork0_#t~mem20#1_5|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1_3|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1_3|, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1=|v_qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1_3|} AuxVars[] AssignedVars[qrcu_updaterThread1of1ForFork0_assume_abort_if_not_~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_~readerstart1#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#t~nondet7#1, qrcu_updaterThread1of1ForFork0_assume_abort_if_not_#in~cond#1, qrcu_updaterThread1of1ForFork0___VERIFIER_atomic_check_progress1_#in~readerstart1#1][176], [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, Black: 211#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0) (= ~ctr1~0 1)), 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)), 128#L777-3true, Black: 207#(and (= ~ctr2~0 0) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), Black: 209#(and (<= 2 |qrcu_updaterThread1of1ForFork0_~sum~0#1|) (= ~ctr2~0 0)), 204#true, 270#true, 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)), qrcu_updaterThread1of1ForFork0InUse, 267#(= ~readerprogress1~0 2), 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, 28#L757true, Black: 186#(= ~readerprogress1~0 0)]) [2022-11-02 20:32:25,303 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,303 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,304 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,304 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:25,340 INFO L381 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][223], [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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:25,340 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,340 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,340 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,341 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,341 INFO L381 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][224], [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) (= ~ctr1~0 1)), 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) (= ~ctr1~0 1)), Black: 206#(= ~ctr1~0 1), 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-11-02 20:32:25,342 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 20:32:25,342 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,342 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,342 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:32:25,505 INFO L130 PetriNetUnfolder]: 1538/4906 cut-off events. [2022-11-02 20:32:25,505 INFO L131 PetriNetUnfolder]: For 5480/5752 co-relation queries the response was YES. [2022-11-02 20:32:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11474 conditions, 4906 events. 1538/4906 cut-off events. For 5480/5752 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 47336 event pairs, 200 based on Foata normal form. 111/4634 useless extension candidates. Maximal degree in co-relation 11119. Up to 1139 conditions per place. [2022-11-02 20:32:25,592 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 70 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2022-11-02 20:32:25,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 258 transitions, 1265 flow [2022-11-02 20:32:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-02 20:32:25,595 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2022-11-02 20:32:25,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-02 20:32:25,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-02 20:32:25,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:25,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-02 20:32:25,597 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-11-02 20:32:25,599 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-11-02 20:32:25,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:25,600 INFO L175 Difference]: Start difference. First operand has 208 places, 237 transitions, 994 flow. Second operand 3 states and 500 transitions. [2022-11-02 20:32:25,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 258 transitions, 1265 flow [2022-11-02 20:32:25,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 258 transitions, 1264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:32:25,629 INFO L231 Difference]: Finished difference. Result has 210 places, 237 transitions, 998 flow [2022-11-02 20:32:25,630 INFO L270 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-11-02 20:32:25,633 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 50 predicate places. [2022-11-02 20:32:25,633 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 237 transitions, 998 flow [2022-11-02 20:32:25,634 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-11-02 20:32:25,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:25,634 INFO L208 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-11-02 20:32:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:32:25,635 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-11-02 20:32:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash -637520708, now seen corresponding path program 1 times [2022-11-02 20:32:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:25,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241221888] [2022-11-02 20:32:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241221888] [2022-11-02 20:32:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241221888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:25,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:25,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281019945] [2022-11-02 20:32:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:25,763 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-11-02 20:32:25,764 INFO L100 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-11-02 20:32:25,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:25,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-11-02 20:32:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:27,171 INFO L130 PetriNetUnfolder]: 1766/5380 cut-off events. [2022-11-02 20:32:27,172 INFO L131 PetriNetUnfolder]: For 6303/6533 co-relation queries the response was YES. [2022-11-02 20:32:27,245 INFO L83 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 230. Compared 50211 event pairs, 317 based on Foata normal form. 40/4971 useless extension candidates. Maximal degree in co-relation 11793. Up to 1261 conditions per place. [2022-11-02 20:32:27,258 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 49 selfloop transitions, 2 changer transitions 43/237 dead transitions. [2022-11-02 20:32:27,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 237 transitions, 1140 flow [2022-11-02 20:32:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-11-02 20:32:27,261 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8943533697632058 [2022-11-02 20:32:27,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2022-11-02 20:32:27,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2022-11-02 20:32:27,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:27,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2022-11-02 20:32:27,266 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-11-02 20:32:27,268 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-11-02 20:32:27,269 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-11-02 20:32:27,269 INFO L175 Difference]: Start difference. First operand has 210 places, 237 transitions, 998 flow. Second operand 3 states and 491 transitions. [2022-11-02 20:32:27,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 237 transitions, 1140 flow [2022-11-02 20:32:27,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 237 transitions, 1131 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-02 20:32:27,301 INFO L231 Difference]: Finished difference. Result has 202 places, 181 transitions, 675 flow [2022-11-02 20:32:27,302 INFO L270 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-11-02 20:32:27,303 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 42 predicate places. [2022-11-02 20:32:27,304 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 181 transitions, 675 flow [2022-11-02 20:32:27,304 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-11-02 20:32:27,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:27,305 INFO L208 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-11-02 20:32:27,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:32:27,305 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-11-02 20:32:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1805213344, now seen corresponding path program 1 times [2022-11-02 20:32:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:27,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654409548] [2022-11-02 20:32:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654409548] [2022-11-02 20:32:27,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654409548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:27,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:27,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:32:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819924070] [2022-11-02 20:32:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:27,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:32:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:32:27,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:32:27,438 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183 [2022-11-02 20:32:27,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 181 transitions, 675 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-11-02 20:32:27,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:27,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183 [2022-11-02 20:32:27,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:28,053 INFO L130 PetriNetUnfolder]: 590/2147 cut-off events. [2022-11-02 20:32:28,053 INFO L131 PetriNetUnfolder]: For 2031/2070 co-relation queries the response was YES. [2022-11-02 20:32:28,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4718 conditions, 2147 events. 590/2147 cut-off events. For 2031/2070 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 17034 event pairs, 132 based on Foata normal form. 9/2007 useless extension candidates. Maximal degree in co-relation 4476. Up to 520 conditions per place. [2022-11-02 20:32:28,088 INFO L137 encePairwiseOnDemand]: 181/183 looper letters, 49 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2022-11-02 20:32:28,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 191 transitions, 833 flow [2022-11-02 20:32:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:32:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:32:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-11-02 20:32:28,092 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-11-02 20:32:28,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2022-11-02 20:32:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2022-11-02 20:32:28,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:28,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2022-11-02 20:32:28,095 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-11-02 20:32:28,097 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-11-02 20:32:28,098 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-11-02 20:32:28,099 INFO L175 Difference]: Start difference. First operand has 202 places, 181 transitions, 675 flow. Second operand 3 states and 488 transitions. [2022-11-02 20:32:28,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 191 transitions, 833 flow [2022-11-02 20:32:28,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 191 transitions, 797 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-11-02 20:32:28,114 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 643 flow [2022-11-02 20:32:28,116 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2022-11-02 20:32:28,117 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 23 predicate places. [2022-11-02 20:32:28,117 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 643 flow [2022-11-02 20:32:28,118 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-11-02 20:32:28,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:28,119 INFO L208 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-11-02 20:32:28,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:32:28,119 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-11-02 20:32:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1806226238, now seen corresponding path program 1 times [2022-11-02 20:32:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:28,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746461522] [2022-11-02 20:32:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:28,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746461522] [2022-11-02 20:32:28,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746461522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:28,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:28,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:32:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191710302] [2022-11-02 20:32:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:28,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:28,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:28,304 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 183 [2022-11-02 20:32:28,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 643 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-11-02 20:32:28,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:28,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 183 [2022-11-02 20:32:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:29,136 INFO L130 PetriNetUnfolder]: 781/2746 cut-off events. [2022-11-02 20:32:29,136 INFO L131 PetriNetUnfolder]: For 2376/2398 co-relation queries the response was YES. [2022-11-02 20:32:29,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6243 conditions, 2746 events. 781/2746 cut-off events. For 2376/2398 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 24544 event pairs, 209 based on Foata normal form. 9/2664 useless extension candidates. Maximal degree in co-relation 5902. Up to 802 conditions per place. [2022-11-02 20:32:29,179 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 64 selfloop transitions, 24 changer transitions 11/233 dead transitions. [2022-11-02 20:32:29,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 233 transitions, 1092 flow [2022-11-02 20:32:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:32:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-11-02 20:32:29,184 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8727556596409055 [2022-11-02 20:32:29,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1118 transitions. [2022-11-02 20:32:29,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1118 transitions. [2022-11-02 20:32:29,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:29,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1118 transitions. [2022-11-02 20:32:29,190 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-11-02 20:32:29,193 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-11-02 20:32:29,194 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-11-02 20:32:29,195 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 643 flow. Second operand 7 states and 1118 transitions. [2022-11-02 20:32:29,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 233 transitions, 1092 flow [2022-11-02 20:32:29,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 233 transitions, 1091 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:32:29,213 INFO L231 Difference]: Finished difference. Result has 192 places, 192 transitions, 817 flow [2022-11-02 20:32:29,214 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=192, PETRI_TRANSITIONS=192} [2022-11-02 20:32:29,214 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 32 predicate places. [2022-11-02 20:32:29,215 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 192 transitions, 817 flow [2022-11-02 20:32:29,215 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-11-02 20:32:29,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:29,216 INFO L208 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-11-02 20:32:29,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:32:29,216 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-11-02 20:32:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1278443168, now seen corresponding path program 1 times [2022-11-02 20:32:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:29,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626047754] [2022-11-02 20:32:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:29,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:29,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626047754] [2022-11-02 20:32:29,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626047754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:29,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:29,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:32:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205379714] [2022-11-02 20:32:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:29,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:29,817 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:29,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 192 transitions, 817 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-11-02 20:32:29,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:29,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:29,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:31,474 INFO L130 PetriNetUnfolder]: 1778/4301 cut-off events. [2022-11-02 20:32:31,475 INFO L131 PetriNetUnfolder]: For 8204/8285 co-relation queries the response was YES. [2022-11-02 20:32:31,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12690 conditions, 4301 events. 1778/4301 cut-off events. For 8204/8285 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 35726 event pairs, 377 based on Foata normal form. 58/4248 useless extension candidates. Maximal degree in co-relation 12329. Up to 1782 conditions per place. [2022-11-02 20:32:31,521 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 127 selfloop transitions, 51 changer transitions 14/302 dead transitions. [2022-11-02 20:32:31,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 302 transitions, 1872 flow [2022-11-02 20:32:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:32:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:32:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1861 transitions. [2022-11-02 20:32:31,530 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7263856362217018 [2022-11-02 20:32:31,530 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1861 transitions. [2022-11-02 20:32:31,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1861 transitions. [2022-11-02 20:32:31,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:31,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1861 transitions. [2022-11-02 20:32:31,537 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-11-02 20:32:31,543 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-11-02 20:32:31,544 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-11-02 20:32:31,545 INFO L175 Difference]: Start difference. First operand has 192 places, 192 transitions, 817 flow. Second operand 14 states and 1861 transitions. [2022-11-02 20:32:31,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 302 transitions, 1872 flow [2022-11-02 20:32:31,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 302 transitions, 1872 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:32:31,586 INFO L231 Difference]: Finished difference. Result has 211 places, 220 transitions, 1250 flow [2022-11-02 20:32:31,587 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1250, PETRI_PLACES=211, PETRI_TRANSITIONS=220} [2022-11-02 20:32:31,589 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 51 predicate places. [2022-11-02 20:32:31,589 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 220 transitions, 1250 flow [2022-11-02 20:32:31,590 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-11-02 20:32:31,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:31,590 INFO L208 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-11-02 20:32:31,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:32:31,591 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-11-02 20:32:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 449319702, now seen corresponding path program 2 times [2022-11-02 20:32:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747517190] [2022-11-02 20:32:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:32,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747517190] [2022-11-02 20:32:32,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747517190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:32,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:32,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:32:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890226152] [2022-11-02 20:32:32,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:32,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:32,027 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:32,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 220 transitions, 1250 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-11-02 20:32:32,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:32,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:33,704 INFO L130 PetriNetUnfolder]: 1767/4351 cut-off events. [2022-11-02 20:32:33,705 INFO L131 PetriNetUnfolder]: For 11662/11776 co-relation queries the response was YES. [2022-11-02 20:32:33,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14023 conditions, 4351 events. 1767/4351 cut-off events. For 11662/11776 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 36550 event pairs, 448 based on Foata normal form. 82/4293 useless extension candidates. Maximal degree in co-relation 13668. Up to 1665 conditions per place. [2022-11-02 20:32:33,754 INFO L137 encePairwiseOnDemand]: 168/183 looper letters, 122 selfloop transitions, 71 changer transitions 38/341 dead transitions. [2022-11-02 20:32:33,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 341 transitions, 2623 flow [2022-11-02 20:32:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:32:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:32:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2120 transitions. [2022-11-02 20:32:33,765 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7240437158469946 [2022-11-02 20:32:33,765 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2120 transitions. [2022-11-02 20:32:33,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2120 transitions. [2022-11-02 20:32:33,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:33,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2120 transitions. [2022-11-02 20:32:33,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 132.5) internal successors, (2120), 16 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:33,786 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-11-02 20:32:33,798 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-11-02 20:32:33,808 INFO L175 Difference]: Start difference. First operand has 211 places, 220 transitions, 1250 flow. Second operand 16 states and 2120 transitions. [2022-11-02 20:32:33,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 341 transitions, 2623 flow [2022-11-02 20:32:33,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 341 transitions, 2563 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:33,879 INFO L231 Difference]: Finished difference. Result has 228 places, 237 transitions, 1603 flow [2022-11-02 20:32:33,880 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1603, PETRI_PLACES=228, PETRI_TRANSITIONS=237} [2022-11-02 20:32:33,882 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 68 predicate places. [2022-11-02 20:32:33,882 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 237 transitions, 1603 flow [2022-11-02 20:32:33,883 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-11-02 20:32:33,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:33,884 INFO L208 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-11-02 20:32:33,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:32:33,885 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-11-02 20:32:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1577092106, now seen corresponding path program 1 times [2022-11-02 20:32:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:33,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044358974] [2022-11-02 20:32:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:33,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044358974] [2022-11-02 20:32:34,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044358974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:34,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:34,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:32:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219987428] [2022-11-02 20:32:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:34,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:34,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 237 transitions, 1603 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-11-02 20:32:34,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:34,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:34,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:35,893 INFO L130 PetriNetUnfolder]: 1419/3711 cut-off events. [2022-11-02 20:32:35,893 INFO L131 PetriNetUnfolder]: For 14407/14579 co-relation queries the response was YES. [2022-11-02 20:32:35,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12417 conditions, 3711 events. 1419/3711 cut-off events. For 14407/14579 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 31381 event pairs, 278 based on Foata normal form. 163/3754 useless extension candidates. Maximal degree in co-relation 12312. Up to 772 conditions per place. [2022-11-02 20:32:35,933 INFO L137 encePairwiseOnDemand]: 160/183 looper letters, 139 selfloop transitions, 62 changer transitions 43/354 dead transitions. [2022-11-02 20:32:35,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 354 transitions, 2863 flow [2022-11-02 20:32:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:32:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:32:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2144 transitions. [2022-11-02 20:32:35,940 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2022-11-02 20:32:35,941 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2144 transitions. [2022-11-02 20:32:35,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2144 transitions. [2022-11-02 20:32:35,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:35,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2144 transitions. [2022-11-02 20:32:35,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:35,955 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-11-02 20:32:35,956 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-11-02 20:32:35,956 INFO L175 Difference]: Start difference. First operand has 228 places, 237 transitions, 1603 flow. Second operand 16 states and 2144 transitions. [2022-11-02 20:32:35,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 354 transitions, 2863 flow [2022-11-02 20:32:36,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 354 transitions, 2792 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:36,024 INFO L231 Difference]: Finished difference. Result has 244 places, 244 transitions, 1826 flow [2022-11-02 20:32:36,025 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1826, PETRI_PLACES=244, PETRI_TRANSITIONS=244} [2022-11-02 20:32:36,026 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 84 predicate places. [2022-11-02 20:32:36,026 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 244 transitions, 1826 flow [2022-11-02 20:32:36,027 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-11-02 20:32:36,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:36,027 INFO L208 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-11-02 20:32:36,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:32:36,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1354881048, now seen corresponding path program 1 times [2022-11-02 20:32:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:36,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947791187] [2022-11-02 20:32:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947791187] [2022-11-02 20:32:36,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947791187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:36,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:36,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:32:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703251720] [2022-11-02 20:32:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:32:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:36,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:32:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:36,385 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:36,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 244 transitions, 1826 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-11-02 20:32:36,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:36,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:36,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:37,580 INFO L130 PetriNetUnfolder]: 1338/3679 cut-off events. [2022-11-02 20:32:37,581 INFO L131 PetriNetUnfolder]: For 18278/18449 co-relation queries the response was YES. [2022-11-02 20:32:37,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12747 conditions, 3679 events. 1338/3679 cut-off events. For 18278/18449 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 31287 event pairs, 117 based on Foata normal form. 167/3726 useless extension candidates. Maximal degree in co-relation 12503. Up to 887 conditions per place. [2022-11-02 20:32:37,635 INFO L137 encePairwiseOnDemand]: 166/183 looper letters, 168 selfloop transitions, 58 changer transitions 27/363 dead transitions. [2022-11-02 20:32:37,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 363 transitions, 3233 flow [2022-11-02 20:32:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:32:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:32:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1639 transitions. [2022-11-02 20:32:37,641 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7463570127504554 [2022-11-02 20:32:37,641 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1639 transitions. [2022-11-02 20:32:37,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1639 transitions. [2022-11-02 20:32:37,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:37,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1639 transitions. [2022-11-02 20:32:37,647 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-11-02 20:32:37,652 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-11-02 20:32:37,653 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-11-02 20:32:37,653 INFO L175 Difference]: Start difference. First operand has 244 places, 244 transitions, 1826 flow. Second operand 12 states and 1639 transitions. [2022-11-02 20:32:37,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 363 transitions, 3233 flow [2022-11-02 20:32:37,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 363 transitions, 3044 flow, removed 68 selfloop flow, removed 6 redundant places. [2022-11-02 20:32:37,766 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 2075 flow [2022-11-02 20:32:37,767 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2075, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2022-11-02 20:32:37,767 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 94 predicate places. [2022-11-02 20:32:37,768 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 2075 flow [2022-11-02 20:32:37,768 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-11-02 20:32:37,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:37,769 INFO L208 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-11-02 20:32:37,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:32:37,769 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2035078910, now seen corresponding path program 1 times [2022-11-02 20:32:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432302812] [2022-11-02 20:32:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432302812] [2022-11-02 20:32:38,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432302812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:38,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:38,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:32:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875987837] [2022-11-02 20:32:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:38,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:38,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:38,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:38,214 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:38,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 2075 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-11-02 20:32:38,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:38,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:38,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:39,519 INFO L130 PetriNetUnfolder]: 1169/3506 cut-off events. [2022-11-02 20:32:39,519 INFO L131 PetriNetUnfolder]: For 17677/17793 co-relation queries the response was YES. [2022-11-02 20:32:39,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12464 conditions, 3506 events. 1169/3506 cut-off events. For 17677/17793 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 29975 event pairs, 182 based on Foata normal form. 102/3483 useless extension candidates. Maximal degree in co-relation 12366. Up to 760 conditions per place. [2022-11-02 20:32:39,560 INFO L137 encePairwiseOnDemand]: 163/183 looper letters, 152 selfloop transitions, 67 changer transitions 35/364 dead transitions. [2022-11-02 20:32:39,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 364 transitions, 3291 flow [2022-11-02 20:32:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:32:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:32:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1891 transitions. [2022-11-02 20:32:39,570 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2022-11-02 20:32:39,571 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1891 transitions. [2022-11-02 20:32:39,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1891 transitions. [2022-11-02 20:32:39,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:39,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1891 transitions. [2022-11-02 20:32:39,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 135.07142857142858) internal successors, (1891), 14 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:39,585 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-11-02 20:32:39,586 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-11-02 20:32:39,586 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 2075 flow. Second operand 14 states and 1891 transitions. [2022-11-02 20:32:39,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 364 transitions, 3291 flow [2022-11-02 20:32:39,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 364 transitions, 3213 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-11-02 20:32:39,694 INFO L231 Difference]: Finished difference. Result has 268 places, 263 transitions, 2195 flow [2022-11-02 20:32:39,695 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2195, PETRI_PLACES=268, PETRI_TRANSITIONS=263} [2022-11-02 20:32:39,695 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2022-11-02 20:32:39,696 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 263 transitions, 2195 flow [2022-11-02 20:32:39,696 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-11-02 20:32:39,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:39,697 INFO L208 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-11-02 20:32:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:32:39,697 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -426273858, now seen corresponding path program 1 times [2022-11-02 20:32:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228070213] [2022-11-02 20:32:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228070213] [2022-11-02 20:32:40,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228070213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:40,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:40,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:32:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797616958] [2022-11-02 20:32:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:40,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:32:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:32:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:40,159 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:40,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 263 transitions, 2195 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-11-02 20:32:40,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:40,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:40,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:41,464 INFO L130 PetriNetUnfolder]: 1124/3368 cut-off events. [2022-11-02 20:32:41,464 INFO L131 PetriNetUnfolder]: For 19351/19463 co-relation queries the response was YES. [2022-11-02 20:32:41,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12223 conditions, 3368 events. 1124/3368 cut-off events. For 19351/19463 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 28850 event pairs, 275 based on Foata normal form. 101/3339 useless extension candidates. Maximal degree in co-relation 11965. Up to 1009 conditions per place. [2022-11-02 20:32:41,506 INFO L137 encePairwiseOnDemand]: 167/183 looper letters, 150 selfloop transitions, 68 changer transitions 17/345 dead transitions. [2022-11-02 20:32:41,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 345 transitions, 3250 flow [2022-11-02 20:32:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:32:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:32:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1618 transitions. [2022-11-02 20:32:41,511 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7367941712204007 [2022-11-02 20:32:41,511 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1618 transitions. [2022-11-02 20:32:41,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1618 transitions. [2022-11-02 20:32:41,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:41,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1618 transitions. [2022-11-02 20:32:41,516 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-11-02 20:32:41,520 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-11-02 20:32:41,521 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-11-02 20:32:41,522 INFO L175 Difference]: Start difference. First operand has 268 places, 263 transitions, 2195 flow. Second operand 12 states and 1618 transitions. [2022-11-02 20:32:41,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 345 transitions, 3250 flow [2022-11-02 20:32:41,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 345 transitions, 3168 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-11-02 20:32:41,644 INFO L231 Difference]: Finished difference. Result has 274 places, 266 transitions, 2369 flow [2022-11-02 20:32:41,645 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2369, PETRI_PLACES=274, PETRI_TRANSITIONS=266} [2022-11-02 20:32:41,645 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 114 predicate places. [2022-11-02 20:32:41,645 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 266 transitions, 2369 flow [2022-11-02 20:32:41,646 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-11-02 20:32:41,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:41,647 INFO L208 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-11-02 20:32:41,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:32:41,647 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-11-02 20:32:41,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1430549014, now seen corresponding path program 2 times [2022-11-02 20:32:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:41,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222883420] [2022-11-02 20:32:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:41,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:42,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222883420] [2022-11-02 20:32:42,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222883420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:42,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:42,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:32:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461150249] [2022-11-02 20:32:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:32:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:32:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:32:42,039 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 183 [2022-11-02 20:32:42,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 266 transitions, 2369 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-11-02 20:32:42,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:42,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 183 [2022-11-02 20:32:42,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:43,411 INFO L130 PetriNetUnfolder]: 956/3036 cut-off events. [2022-11-02 20:32:43,411 INFO L131 PetriNetUnfolder]: For 20575/20694 co-relation queries the response was YES. [2022-11-02 20:32:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11246 conditions, 3036 events. 956/3036 cut-off events. For 20575/20694 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25839 event pairs, 224 based on Foata normal form. 103/3016 useless extension candidates. Maximal degree in co-relation 11139. Up to 827 conditions per place. [2022-11-02 20:32:43,446 INFO L137 encePairwiseOnDemand]: 169/183 looper letters, 134 selfloop transitions, 74 changer transitions 21/334 dead transitions. [2022-11-02 20:32:43,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 334 transitions, 3233 flow [2022-11-02 20:32:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:32:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-02 20:32:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1982 transitions. [2022-11-02 20:32:43,452 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.722040072859745 [2022-11-02 20:32:43,452 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1982 transitions. [2022-11-02 20:32:43,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1982 transitions. [2022-11-02 20:32:43,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:43,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1982 transitions. [2022-11-02 20:32:43,459 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-11-02 20:32:43,464 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-11-02 20:32:43,466 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-11-02 20:32:43,466 INFO L175 Difference]: Start difference. First operand has 274 places, 266 transitions, 2369 flow. Second operand 15 states and 1982 transitions. [2022-11-02 20:32:43,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 334 transitions, 3233 flow [2022-11-02 20:32:43,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 334 transitions, 3194 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:43,596 INFO L231 Difference]: Finished difference. Result has 282 places, 252 transitions, 2361 flow [2022-11-02 20:32:43,596 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2361, PETRI_PLACES=282, PETRI_TRANSITIONS=252} [2022-11-02 20:32:43,597 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 122 predicate places. [2022-11-02 20:32:43,597 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 252 transitions, 2361 flow [2022-11-02 20:32:43,598 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-11-02 20:32:43,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:43,598 INFO L208 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-11-02 20:32:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:32:43,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1627227213, now seen corresponding path program 1 times [2022-11-02 20:32:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:43,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330753307] [2022-11-02 20:32:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:43,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330753307] [2022-11-02 20:32:43,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330753307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:43,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:43,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368217461] [2022-11-02 20:32:43,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:43,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:43,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:43,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:43,933 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:43,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 252 transitions, 2361 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-11-02 20:32:43,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:43,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:44,738 INFO L130 PetriNetUnfolder]: 567/2067 cut-off events. [2022-11-02 20:32:44,738 INFO L131 PetriNetUnfolder]: For 14584/14636 co-relation queries the response was YES. [2022-11-02 20:32:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7688 conditions, 2067 events. 567/2067 cut-off events. For 14584/14636 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16023 event pairs, 91 based on Foata normal form. 30/2012 useless extension candidates. Maximal degree in co-relation 7478. Up to 278 conditions per place. [2022-11-02 20:32:44,759 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 109 selfloop transitions, 36 changer transitions 44/321 dead transitions. [2022-11-02 20:32:44,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 321 transitions, 3269 flow [2022-11-02 20:32:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1625 transitions. [2022-11-02 20:32:44,765 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8072528564331843 [2022-11-02 20:32:44,766 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1625 transitions. [2022-11-02 20:32:44,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1625 transitions. [2022-11-02 20:32:44,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:44,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1625 transitions. [2022-11-02 20:32:44,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.72727272727272) internal successors, (1625), 11 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:44,775 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-11-02 20:32:44,776 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-11-02 20:32:44,776 INFO L175 Difference]: Start difference. First operand has 282 places, 252 transitions, 2361 flow. Second operand 11 states and 1625 transitions. [2022-11-02 20:32:44,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 321 transitions, 3269 flow [2022-11-02 20:32:44,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 321 transitions, 2991 flow, removed 30 selfloop flow, removed 20 redundant places. [2022-11-02 20:32:44,854 INFO L231 Difference]: Finished difference. Result has 270 places, 235 transitions, 2008 flow [2022-11-02 20:32:44,856 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2008, PETRI_PLACES=270, PETRI_TRANSITIONS=235} [2022-11-02 20:32:44,857 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 110 predicate places. [2022-11-02 20:32:44,858 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 235 transitions, 2008 flow [2022-11-02 20:32:44,858 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-11-02 20:32:44,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:44,859 INFO L208 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-11-02 20:32:44,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:32:44,859 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1230280557, now seen corresponding path program 1 times [2022-11-02 20:32:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:44,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443750164] [2022-11-02 20:32:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:45,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443750164] [2022-11-02 20:32:45,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443750164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:45,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:45,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801414920] [2022-11-02 20:32:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:45,143 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:45,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 235 transitions, 2008 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-11-02 20:32:45,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:45,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:45,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:45,951 INFO L130 PetriNetUnfolder]: 531/1952 cut-off events. [2022-11-02 20:32:45,952 INFO L131 PetriNetUnfolder]: For 11448/11497 co-relation queries the response was YES. [2022-11-02 20:32:45,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1952 events. 531/1952 cut-off events. For 11448/11497 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 14897 event pairs, 112 based on Foata normal form. 22/1881 useless extension candidates. Maximal degree in co-relation 6739. Up to 290 conditions per place. [2022-11-02 20:32:45,983 INFO L137 encePairwiseOnDemand]: 171/183 looper letters, 109 selfloop transitions, 44 changer transitions 25/310 dead transitions. [2022-11-02 20:32:45,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 310 transitions, 3019 flow [2022-11-02 20:32:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:32:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:32:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1767 transitions. [2022-11-02 20:32:45,988 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8046448087431693 [2022-11-02 20:32:45,988 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1767 transitions. [2022-11-02 20:32:45,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1767 transitions. [2022-11-02 20:32:45,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:45,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1767 transitions. [2022-11-02 20:32:45,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 147.25) internal successors, (1767), 12 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:45,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 183.0) internal successors, (2379), 13 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:45,998 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-11-02 20:32:45,999 INFO L175 Difference]: Start difference. First operand has 270 places, 235 transitions, 2008 flow. Second operand 12 states and 1767 transitions. [2022-11-02 20:32:45,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 310 transitions, 3019 flow [2022-11-02 20:32:46,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 310 transitions, 2749 flow, removed 21 selfloop flow, removed 20 redundant places. [2022-11-02 20:32:46,059 INFO L231 Difference]: Finished difference. Result has 268 places, 245 transitions, 2034 flow [2022-11-02 20:32:46,060 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2034, PETRI_PLACES=268, PETRI_TRANSITIONS=245} [2022-11-02 20:32:46,060 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 108 predicate places. [2022-11-02 20:32:46,061 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 245 transitions, 2034 flow [2022-11-02 20:32:46,061 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-11-02 20:32:46,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:46,062 INFO L208 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-11-02 20:32:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:32:46,062 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 176899237, now seen corresponding path program 2 times [2022-11-02 20:32:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:46,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106348897] [2022-11-02 20:32:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106348897] [2022-11-02 20:32:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106348897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:46,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:46,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199941908] [2022-11-02 20:32:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:46,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:46,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:46,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:46,335 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:46,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 245 transitions, 2034 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-11-02 20:32:46,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:46,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:46,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:47,135 INFO L130 PetriNetUnfolder]: 540/1988 cut-off events. [2022-11-02 20:32:47,136 INFO L131 PetriNetUnfolder]: For 10388/10472 co-relation queries the response was YES. [2022-11-02 20:32:47,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6873 conditions, 1988 events. 540/1988 cut-off events. For 10388/10472 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15279 event pairs, 104 based on Foata normal form. 50/1929 useless extension candidates. Maximal degree in co-relation 6408. Up to 278 conditions per place. [2022-11-02 20:32:47,166 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 104 selfloop transitions, 52 changer transitions 36/324 dead transitions. [2022-11-02 20:32:47,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 324 transitions, 3085 flow [2022-11-02 20:32:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:32:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:32:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1769 transitions. [2022-11-02 20:32:47,169 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2022-11-02 20:32:47,169 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1769 transitions. [2022-11-02 20:32:47,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1769 transitions. [2022-11-02 20:32:47,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:47,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1769 transitions. [2022-11-02 20:32:47,172 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-11-02 20:32:47,176 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-11-02 20:32:47,177 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-11-02 20:32:47,178 INFO L175 Difference]: Start difference. First operand has 268 places, 245 transitions, 2034 flow. Second operand 12 states and 1769 transitions. [2022-11-02 20:32:47,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 324 transitions, 3085 flow [2022-11-02 20:32:47,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 324 transitions, 2992 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-11-02 20:32:47,238 INFO L231 Difference]: Finished difference. Result has 279 places, 251 transitions, 2183 flow [2022-11-02 20:32:47,239 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2183, PETRI_PLACES=279, PETRI_TRANSITIONS=251} [2022-11-02 20:32:47,240 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 119 predicate places. [2022-11-02 20:32:47,240 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 251 transitions, 2183 flow [2022-11-02 20:32:47,241 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-11-02 20:32:47,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:47,241 INFO L208 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-11-02 20:32:47,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:32:47,242 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-11-02 20:32:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash 611284229, now seen corresponding path program 2 times [2022-11-02 20:32:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:47,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671074526] [2022-11-02 20:32:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:47,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:47,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671074526] [2022-11-02 20:32:47,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671074526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:47,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:47,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112399624] [2022-11-02 20:32:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:47,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:32:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:32:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:32:47,397 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-11-02 20:32:47,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 251 transitions, 2183 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-11-02 20:32:47,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:47,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-11-02 20:32:47,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:47,992 INFO L130 PetriNetUnfolder]: 435/1926 cut-off events. [2022-11-02 20:32:47,992 INFO L131 PetriNetUnfolder]: For 11972/12066 co-relation queries the response was YES. [2022-11-02 20:32:48,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6583 conditions, 1926 events. 435/1926 cut-off events. For 11972/12066 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 15088 event pairs, 106 based on Foata normal form. 46/1847 useless extension candidates. Maximal degree in co-relation 6410. Up to 346 conditions per place. [2022-11-02 20:32:48,026 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 89 selfloop transitions, 10 changer transitions 8/273 dead transitions. [2022-11-02 20:32:48,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 273 transitions, 2602 flow [2022-11-02 20:32:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:32:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2022-11-02 20:32:48,028 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2022-11-02 20:32:48,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2022-11-02 20:32:48,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2022-11-02 20:32:48,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:48,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2022-11-02 20:32:48,031 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-11-02 20:32:48,032 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-11-02 20:32:48,033 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-11-02 20:32:48,033 INFO L175 Difference]: Start difference. First operand has 279 places, 251 transitions, 2183 flow. Second operand 4 states and 643 transitions. [2022-11-02 20:32:48,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 273 transitions, 2602 flow [2022-11-02 20:32:48,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 2466 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-11-02 20:32:48,095 INFO L231 Difference]: Finished difference. Result has 276 places, 250 transitions, 2089 flow [2022-11-02 20:32:48,096 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2089, PETRI_PLACES=276, PETRI_TRANSITIONS=250} [2022-11-02 20:32:48,097 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 116 predicate places. [2022-11-02 20:32:48,097 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 250 transitions, 2089 flow [2022-11-02 20:32:48,097 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-11-02 20:32:48,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:48,098 INFO L208 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-11-02 20:32:48,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:32:48,098 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-11-02 20:32:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -147696905, now seen corresponding path program 3 times [2022-11-02 20:32:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:48,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990744307] [2022-11-02 20:32:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:48,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990744307] [2022-11-02 20:32:48,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990744307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:48,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:48,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698866923] [2022-11-02 20:32:48,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:48,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:48,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:48,446 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:48,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 250 transitions, 2089 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-11-02 20:32:48,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:48,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:48,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:49,290 INFO L130 PetriNetUnfolder]: 493/1999 cut-off events. [2022-11-02 20:32:49,290 INFO L131 PetriNetUnfolder]: For 11999/12192 co-relation queries the response was YES. [2022-11-02 20:32:49,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6926 conditions, 1999 events. 493/1999 cut-off events. For 11999/12192 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15766 event pairs, 112 based on Foata normal form. 101/1982 useless extension candidates. Maximal degree in co-relation 6812. Up to 259 conditions per place. [2022-11-02 20:32:49,312 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 98 selfloop transitions, 52 changer transitions 43/325 dead transitions. [2022-11-02 20:32:49,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 325 transitions, 3202 flow [2022-11-02 20:32:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:32:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:32:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2047 transitions. [2022-11-02 20:32:49,316 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7989851678376269 [2022-11-02 20:32:49,316 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2047 transitions. [2022-11-02 20:32:49,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2047 transitions. [2022-11-02 20:32:49,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:49,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2047 transitions. [2022-11-02 20:32:49,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 146.21428571428572) internal successors, (2047), 14 states have internal predecessors, (2047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:49,326 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-11-02 20:32:49,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-11-02 20:32:49,327 INFO L175 Difference]: Start difference. First operand has 276 places, 250 transitions, 2089 flow. Second operand 14 states and 2047 transitions. [2022-11-02 20:32:49,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 325 transitions, 3202 flow [2022-11-02 20:32:49,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 325 transitions, 3140 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-02 20:32:49,404 INFO L231 Difference]: Finished difference. Result has 290 places, 250 transitions, 2235 flow [2022-11-02 20:32:49,405 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2235, PETRI_PLACES=290, PETRI_TRANSITIONS=250} [2022-11-02 20:32:49,406 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 130 predicate places. [2022-11-02 20:32:49,406 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 250 transitions, 2235 flow [2022-11-02 20:32:49,407 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-11-02 20:32:49,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:49,408 INFO L208 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-11-02 20:32:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:32:49,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1391156979, now seen corresponding path program 1 times [2022-11-02 20:32:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:49,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612322720] [2022-11-02 20:32:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612322720] [2022-11-02 20:32:49,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612322720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:49,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:49,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825649712] [2022-11-02 20:32:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:49,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:49,690 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:49,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 250 transitions, 2235 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-11-02 20:32:49,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:49,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:49,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:50,353 INFO L130 PetriNetUnfolder]: 417/1784 cut-off events. [2022-11-02 20:32:50,353 INFO L131 PetriNetUnfolder]: For 12641/12809 co-relation queries the response was YES. [2022-11-02 20:32:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6489 conditions, 1784 events. 417/1784 cut-off events. For 12641/12809 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 13453 event pairs, 98 based on Foata normal form. 102/1792 useless extension candidates. Maximal degree in co-relation 6298. Up to 284 conditions per place. [2022-11-02 20:32:50,370 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 93 selfloop transitions, 39 changer transitions 37/292 dead transitions. [2022-11-02 20:32:50,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 2928 flow [2022-11-02 20:32:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1599 transitions. [2022-11-02 20:32:50,373 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7943368107302533 [2022-11-02 20:32:50,373 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1599 transitions. [2022-11-02 20:32:50,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1599 transitions. [2022-11-02 20:32:50,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:50,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1599 transitions. [2022-11-02 20:32:50,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.36363636363637) internal successors, (1599), 11 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:50,380 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-11-02 20:32:50,381 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-11-02 20:32:50,382 INFO L175 Difference]: Start difference. First operand has 290 places, 250 transitions, 2235 flow. Second operand 11 states and 1599 transitions. [2022-11-02 20:32:50,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 2928 flow [2022-11-02 20:32:50,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 292 transitions, 2804 flow, removed 14 selfloop flow, removed 13 redundant places. [2022-11-02 20:32:50,442 INFO L231 Difference]: Finished difference. Result has 287 places, 226 transitions, 1810 flow [2022-11-02 20:32:50,442 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1810, PETRI_PLACES=287, PETRI_TRANSITIONS=226} [2022-11-02 20:32:50,443 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 127 predicate places. [2022-11-02 20:32:50,443 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 226 transitions, 1810 flow [2022-11-02 20:32:50,445 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-11-02 20:32:50,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:50,446 INFO L208 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-11-02 20:32:50,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:32:50,446 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -207047255, now seen corresponding path program 1 times [2022-11-02 20:32:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:50,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719268797] [2022-11-02 20:32:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:50,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719268797] [2022-11-02 20:32:50,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719268797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:50,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:50,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:50,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663027995] [2022-11-02 20:32:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:50,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:50,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:50,727 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:50,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 226 transitions, 1810 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-11-02 20:32:50,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:50,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:50,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:51,286 INFO L130 PetriNetUnfolder]: 302/1426 cut-off events. [2022-11-02 20:32:51,287 INFO L131 PetriNetUnfolder]: For 8267/8396 co-relation queries the response was YES. [2022-11-02 20:32:51,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 1426 events. 302/1426 cut-off events. For 8267/8396 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10031 event pairs, 56 based on Foata normal form. 99/1438 useless extension candidates. Maximal degree in co-relation 4782. Up to 157 conditions per place. [2022-11-02 20:32:51,311 INFO L137 encePairwiseOnDemand]: 171/183 looper letters, 91 selfloop transitions, 43 changer transitions 31/282 dead transitions. [2022-11-02 20:32:51,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 282 transitions, 2681 flow [2022-11-02 20:32:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1611 transitions. [2022-11-02 20:32:51,316 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8002980625931445 [2022-11-02 20:32:51,317 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1611 transitions. [2022-11-02 20:32:51,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1611 transitions. [2022-11-02 20:32:51,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:51,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1611 transitions. [2022-11-02 20:32:51,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.45454545454547) internal successors, (1611), 11 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:51,325 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-11-02 20:32:51,326 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-11-02 20:32:51,326 INFO L175 Difference]: Start difference. First operand has 287 places, 226 transitions, 1810 flow. Second operand 11 states and 1611 transitions. [2022-11-02 20:32:51,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 282 transitions, 2681 flow [2022-11-02 20:32:51,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 282 transitions, 2355 flow, removed 9 selfloop flow, removed 29 redundant places. [2022-11-02 20:32:51,376 INFO L231 Difference]: Finished difference. Result has 271 places, 223 transitions, 1673 flow [2022-11-02 20:32:51,376 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1673, PETRI_PLACES=271, PETRI_TRANSITIONS=223} [2022-11-02 20:32:51,377 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 111 predicate places. [2022-11-02 20:32:51,377 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 223 transitions, 1673 flow [2022-11-02 20:32:51,378 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-11-02 20:32:51,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:51,378 INFO L208 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-11-02 20:32:51,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:32:51,379 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-11-02 20:32:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1686518922, now seen corresponding path program 1 times [2022-11-02 20:32:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418300878] [2022-11-02 20:32:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:51,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418300878] [2022-11-02 20:32:51,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418300878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:51,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090652582] [2022-11-02 20:32:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:51,656 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:51,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 223 transitions, 1673 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-11-02 20:32:51,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:51,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:51,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:52,114 INFO L130 PetriNetUnfolder]: 230/1074 cut-off events. [2022-11-02 20:32:52,115 INFO L131 PetriNetUnfolder]: For 5279/5408 co-relation queries the response was YES. [2022-11-02 20:32:52,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 1074 events. 230/1074 cut-off events. For 5279/5408 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6699 event pairs, 50 based on Foata normal form. 97/1088 useless extension candidates. Maximal degree in co-relation 3240. Up to 142 conditions per place. [2022-11-02 20:32:52,124 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 47 selfloop transitions, 19 changer transitions 77/249 dead transitions. [2022-11-02 20:32:52,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 249 transitions, 2184 flow [2022-11-02 20:32:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:32:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:32:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1445 transitions. [2022-11-02 20:32:52,128 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7896174863387978 [2022-11-02 20:32:52,128 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1445 transitions. [2022-11-02 20:32:52,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1445 transitions. [2022-11-02 20:32:52,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:52,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1445 transitions. [2022-11-02 20:32:52,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.5) internal successors, (1445), 10 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:52,135 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-11-02 20:32:52,136 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-11-02 20:32:52,136 INFO L175 Difference]: Start difference. First operand has 271 places, 223 transitions, 1673 flow. Second operand 10 states and 1445 transitions. [2022-11-02 20:32:52,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 249 transitions, 2184 flow [2022-11-02 20:32:52,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 249 transitions, 2054 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-11-02 20:32:52,170 INFO L231 Difference]: Finished difference. Result has 265 places, 162 transitions, 911 flow [2022-11-02 20:32:52,171 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=911, PETRI_PLACES=265, PETRI_TRANSITIONS=162} [2022-11-02 20:32:52,171 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 105 predicate places. [2022-11-02 20:32:52,172 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 162 transitions, 911 flow [2022-11-02 20:32:52,172 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-11-02 20:32:52,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:52,173 INFO L208 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-11-02 20:32:52,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:32:52,173 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-11-02 20:32:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -34214137, now seen corresponding path program 2 times [2022-11-02 20:32:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:52,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722889949] [2022-11-02 20:32:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:52,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722889949] [2022-11-02 20:32:52,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722889949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:52,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:52,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:52,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568573657] [2022-11-02 20:32:52,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:52,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:52,445 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:52,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 162 transitions, 911 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-11-02 20:32:52,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:52,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:52,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:52,795 INFO L130 PetriNetUnfolder]: 143/698 cut-off events. [2022-11-02 20:32:52,795 INFO L131 PetriNetUnfolder]: For 2687/2723 co-relation queries the response was YES. [2022-11-02 20:32:52,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 698 events. 143/698 cut-off events. For 2687/2723 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3657 event pairs, 46 based on Foata normal form. 15/656 useless extension candidates. Maximal degree in co-relation 2022. Up to 84 conditions per place. [2022-11-02 20:32:52,800 INFO L137 encePairwiseOnDemand]: 172/183 looper letters, 44 selfloop transitions, 24 changer transitions 23/197 dead transitions. [2022-11-02 20:32:52,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 197 transitions, 1375 flow [2022-11-02 20:32:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:32:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:32:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1863 transitions. [2022-11-02 20:32:52,804 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7831021437578815 [2022-11-02 20:32:52,804 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1863 transitions. [2022-11-02 20:32:52,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1863 transitions. [2022-11-02 20:32:52,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:52,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1863 transitions. [2022-11-02 20:32:52,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.30769230769232) internal successors, (1863), 13 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:52,812 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-11-02 20:32:52,812 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-11-02 20:32:52,813 INFO L175 Difference]: Start difference. First operand has 265 places, 162 transitions, 911 flow. Second operand 13 states and 1863 transitions. [2022-11-02 20:32:52,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 197 transitions, 1375 flow [2022-11-02 20:32:52,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 197 transitions, 1019 flow, removed 22 selfloop flow, removed 56 redundant places. [2022-11-02 20:32:52,827 INFO L231 Difference]: Finished difference. Result has 201 places, 162 transitions, 719 flow [2022-11-02 20:32:52,827 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=185, 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=13, PETRI_FLOW=719, PETRI_PLACES=201, PETRI_TRANSITIONS=162} [2022-11-02 20:32:52,828 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2022-11-02 20:32:52,828 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 162 transitions, 719 flow [2022-11-02 20:32:52,829 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-11-02 20:32:52,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:52,829 INFO L208 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-11-02 20:32:52,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:32:52,830 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-11-02 20:32:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1923984531, now seen corresponding path program 2 times [2022-11-02 20:32:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:52,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786470204] [2022-11-02 20:32:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:52,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:52,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786470204] [2022-11-02 20:32:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786470204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:52,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:52,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:32:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438041391] [2022-11-02 20:32:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:32:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:32:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:32:53,002 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183 [2022-11-02 20:32:53,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 162 transitions, 719 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-11-02 20:32:53,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:53,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183 [2022-11-02 20:32:53,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:53,159 INFO L130 PetriNetUnfolder]: 102/584 cut-off events. [2022-11-02 20:32:53,159 INFO L131 PetriNetUnfolder]: For 1504/1526 co-relation queries the response was YES. [2022-11-02 20:32:53,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 584 events. 102/584 cut-off events. For 1504/1526 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2727 event pairs, 31 based on Foata normal form. 15/546 useless extension candidates. Maximal degree in co-relation 1408. Up to 85 conditions per place. [2022-11-02 20:32:53,166 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 35 selfloop transitions, 8 changer transitions 2/168 dead transitions. [2022-11-02 20:32:53,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 168 transitions, 856 flow [2022-11-02 20:32:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:32:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-11-02 20:32:53,172 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8579234972677595 [2022-11-02 20:32:53,172 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2022-11-02 20:32:53,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2022-11-02 20:32:53,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:53,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2022-11-02 20:32:53,175 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-11-02 20:32:53,176 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-11-02 20:32:53,176 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-11-02 20:32:53,177 INFO L175 Difference]: Start difference. First operand has 201 places, 162 transitions, 719 flow. Second operand 4 states and 628 transitions. [2022-11-02 20:32:53,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 168 transitions, 856 flow [2022-11-02 20:32:53,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 168 transitions, 764 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-02 20:32:53,186 INFO L231 Difference]: Finished difference. Result has 192 places, 162 transitions, 668 flow [2022-11-02 20:32:53,186 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=187, 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=192, PETRI_TRANSITIONS=162} [2022-11-02 20:32:53,191 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 32 predicate places. [2022-11-02 20:32:53,192 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 162 transitions, 668 flow [2022-11-02 20:32:53,192 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-11-02 20:32:53,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:53,193 INFO L208 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-11-02 20:32:53,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:32:53,193 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION === [qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION, qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:32:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1478249847, now seen corresponding path program 1 times [2022-11-02 20:32:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320338054] [2022-11-02 20:32:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:53,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:53,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320338054] [2022-11-02 20:32:53,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320338054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:53,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:53,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:32:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159692869] [2022-11-02 20:32:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:32:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:32:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:32:53,464 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2022-11-02 20:32:53,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 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-11-02 20:32:53,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:53,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2022-11-02 20:32:53,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:53,689 INFO L130 PetriNetUnfolder]: 111/563 cut-off events. [2022-11-02 20:32:53,689 INFO L131 PetriNetUnfolder]: For 1773/1800 co-relation queries the response was YES. [2022-11-02 20:32:53,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 563 events. 111/563 cut-off events. For 1773/1800 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2572 event pairs, 22 based on Foata normal form. 20/531 useless extension candidates. Maximal degree in co-relation 1410. Up to 79 conditions per place. [2022-11-02 20:32:53,692 INFO L137 encePairwiseOnDemand]: 173/183 looper letters, 0 selfloop transitions, 0 changer transitions 178/178 dead transitions. [2022-11-02 20:32:53,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 937 flow [2022-11-02 20:32:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:32:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:32:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1287 transitions. [2022-11-02 20:32:53,695 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7814207650273224 [2022-11-02 20:32:53,695 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1287 transitions. [2022-11-02 20:32:53,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1287 transitions. [2022-11-02 20:32:53,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:53,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1287 transitions. [2022-11-02 20:32:53,696 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-11-02 20:32:53,698 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-11-02 20:32:53,698 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-11-02 20:32:53,698 INFO L175 Difference]: Start difference. First operand has 192 places, 162 transitions, 668 flow. Second operand 9 states and 1287 transitions. [2022-11-02 20:32:53,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 178 transitions, 937 flow [2022-11-02 20:32:53,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 178 transitions, 914 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-02 20:32:53,704 INFO L231 Difference]: Finished difference. Result has 196 places, 0 transitions, 0 flow [2022-11-02 20:32:53,704 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=188, 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=196, PETRI_TRANSITIONS=0} [2022-11-02 20:32:53,705 INFO L287 CegarLoopForPetriNet]: 160 programPoint places, 36 predicate places. [2022-11-02 20:32:53,705 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 0 transitions, 0 flow [2022-11-02 20:32:53,705 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-11-02 20:32:53,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 20:32:53,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:32:53,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 20:32:53,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 20:32:53,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 20:32:53,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-02 20:32:53,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location qrcu_updaterErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:32:53,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:32:53,717 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:53,725 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:32:53,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:32:53,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:32:53 BasicIcfg [2022-11-02 20:32:53,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:32:53,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:32:53,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:32:53,736 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:32:53,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:09" (3/4) ... [2022-11-02 20:32:53,740 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:32:53,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader1 [2022-11-02 20:32:53,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_reader2 [2022-11-02 20:32:53,747 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure qrcu_updater [2022-11-02 20:32:53,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-02 20:32:53,752 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:32:53,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:32:53,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:32:53,803 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:32:53,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:32:53,805 INFO L158 Benchmark]: Toolchain (without parser) took 46053.42ms. Allocated memory was 98.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 63.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 437.7MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,805 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 98.6MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:32:53,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.13ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 63.1MB in the end (delta: 400.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.70ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,806 INFO L158 Benchmark]: Boogie Preprocessor took 78.62ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,807 INFO L158 Benchmark]: RCFGBuilder took 1225.18ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 58.4MB in the beginning and 77.6MB in the end (delta: -19.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,807 INFO L158 Benchmark]: TraceAbstraction took 43838.35ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 76.8MB in the beginning and 1.1GB in the end (delta: -999.4MB). Peak memory consumption was 422.1MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,808 INFO L158 Benchmark]: Witness Printer took 67.64ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:32:53,817 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.35ms. Allocated memory is still 98.6MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.13ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 63.1MB in the end (delta: 400.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.70ms. Allocated memory is still 98.6MB. Free memory was 63.1MB in the beginning and 60.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.62ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1225.18ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 58.4MB in the beginning and 77.6MB in the end (delta: -19.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43838.35ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 76.8MB in the beginning and 1.1GB in the end (delta: -999.4MB). Peak memory consumption was 422.1MB. Max. memory is 16.1GB. * Witness Printer took 67.64ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 43.6s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2081 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2081 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2485 mSDsCounter, 492 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6783 IncrementalHoareTripleChecker+Invalid, 7275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 492 mSolverCounterUnsat, 436 mSDtfsCounter, 6783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2369occurred in iteration=17, InterpolantAutomatonStates: 270, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2409 ConstructedInterpolants, 0 QuantifiedInterpolants, 11414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:32:53,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb1de61-ac9f-4427-903b-466770690a05/bin/uautomizer-Dbtcem3rbc/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