./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9d4cee005db193e9c1facb47684505767d12f23c1b879219be0e7ba3c7b775ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:42:28,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:42:28,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:42:28,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:42:28,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:42:28,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:42:28,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:42:28,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:42:28,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:42:28,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:42:28,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:42:28,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:42:28,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:42:28,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:42:28,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:42:28,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:42:28,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:42:28,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:42:28,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:42:28,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:42:28,822 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:42:28,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:42:28,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:42:28,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:42:28,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:42:28,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:42:28,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:42:28,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:42:28,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:42:28,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:42:28,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:42:28,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:42:28,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:42:28,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:42:28,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:42:28,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:42:28,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:42:28,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:42:28,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:42:28,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:42:28,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:42:28,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:42:28,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:42:28,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:42:28,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:42:28,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:42:28,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:42:28,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:42:28,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:42:28,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:42:28,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:42:28,868 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:42:28,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:42:28,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:42:28,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:42:28,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:42:28,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:42:28,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:42:28,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:42:28,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:42:28,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:42:28,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:42:28,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:28,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:42:28,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:42:28,877 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:42:28,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:42:28,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:42:28,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d4cee005db193e9c1facb47684505767d12f23c1b879219be0e7ba3c7b775ac [2022-07-21 15:42:29,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:42:29,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:42:29,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:42:29,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:42:29,123 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:42:29,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i [2022-07-21 15:42:29,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52412700/ebe2201b1df84041965098a412632cc5/FLAG36bb765ce [2022-07-21 15:42:29,839 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:42:29,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i [2022-07-21 15:42:29,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52412700/ebe2201b1df84041965098a412632cc5/FLAG36bb765ce [2022-07-21 15:42:30,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52412700/ebe2201b1df84041965098a412632cc5 [2022-07-21 15:42:30,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:42:30,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:42:30,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:30,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:42:30,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:42:30,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:30" (1/1) ... [2022-07-21 15:42:30,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cbc61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:30, skipping insertion in model container [2022-07-21 15:42:30,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:42:30" (1/1) ... [2022-07-21 15:42:30,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:42:30,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:42:32,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364624,364637] [2022-07-21 15:42:32,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364769,364782] [2022-07-21 15:42:32,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364915,364928] [2022-07-21 15:42:32,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365080,365093] [2022-07-21 15:42:32,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365238,365251] [2022-07-21 15:42:32,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365396,365409] [2022-07-21 15:42:32,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365554,365567] [2022-07-21 15:42:32,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365714,365727] [2022-07-21 15:42:32,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365873,365886] [2022-07-21 15:42:32,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366012,366025] [2022-07-21 15:42:32,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366154,366167] [2022-07-21 15:42:32,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366303,366316] [2022-07-21 15:42:32,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366442,366455] [2022-07-21 15:42:32,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366597,366610] [2022-07-21 15:42:32,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366757,366770] [2022-07-21 15:42:32,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366908,366921] [2022-07-21 15:42:32,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367059,367072] [2022-07-21 15:42:32,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367211,367224] [2022-07-21 15:42:32,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367360,367373] [2022-07-21 15:42:32,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367508,367521] [2022-07-21 15:42:32,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367665,367678] [2022-07-21 15:42:32,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367814,367827] [2022-07-21 15:42:32,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367970,367983] [2022-07-21 15:42:32,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368123,368136] [2022-07-21 15:42:32,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368269,368282] [2022-07-21 15:42:32,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368412,368425] [2022-07-21 15:42:32,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368564,368577] [2022-07-21 15:42:32,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368710,368723] [2022-07-21 15:42:32,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368855,368868] [2022-07-21 15:42:32,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369009,369022] [2022-07-21 15:42:32,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369160,369173] [2022-07-21 15:42:32,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369315,369328] [2022-07-21 15:42:32,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369467,369480] [2022-07-21 15:42:32,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369622,369635] [2022-07-21 15:42:32,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369786,369799] [2022-07-21 15:42:32,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369942,369955] [2022-07-21 15:42:32,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370106,370119] [2022-07-21 15:42:32,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370248,370261] [2022-07-21 15:42:32,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370406,370419] [2022-07-21 15:42:32,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370573,370586] [2022-07-21 15:42:32,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370732,370745] [2022-07-21 15:42:32,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370891,370904] [2022-07-21 15:42:32,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371040,371053] [2022-07-21 15:42:32,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371187,371200] [2022-07-21 15:42:32,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371326,371339] [2022-07-21 15:42:32,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371489,371502] [2022-07-21 15:42:32,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371655,371668] [2022-07-21 15:42:32,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371819,371832] [2022-07-21 15:42:32,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371984,371997] [2022-07-21 15:42:32,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372149,372162] [2022-07-21 15:42:32,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372315,372328] [2022-07-21 15:42:32,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372480,372493] [2022-07-21 15:42:32,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372647,372660] [2022-07-21 15:42:32,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372807,372820] [2022-07-21 15:42:32,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372969,372982] [2022-07-21 15:42:32,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373128,373141] [2022-07-21 15:42:32,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373274,373287] [2022-07-21 15:42:32,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373417,373430] [2022-07-21 15:42:32,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373561,373574] [2022-07-21 15:42:32,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373704,373717] [2022-07-21 15:42:32,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373848,373861] [2022-07-21 15:42:32,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373989,374002] [2022-07-21 15:42:32,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374127,374140] [2022-07-21 15:42:32,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374285,374298] [2022-07-21 15:42:32,554 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374444,374457] [2022-07-21 15:42:32,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374600,374613] [2022-07-21 15:42:32,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374749,374762] [2022-07-21 15:42:32,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374901,374914] [2022-07-21 15:42:32,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375052,375065] [2022-07-21 15:42:32,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375201,375214] [2022-07-21 15:42:32,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375353,375366] [2022-07-21 15:42:32,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375501,375514] [2022-07-21 15:42:32,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375654,375667] [2022-07-21 15:42:32,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375805,375818] [2022-07-21 15:42:32,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375955,375968] [2022-07-21 15:42:32,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376102,376115] [2022-07-21 15:42:32,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376253,376266] [2022-07-21 15:42:32,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376404,376417] [2022-07-21 15:42:32,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376552,376565] [2022-07-21 15:42:32,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376718,376731] [2022-07-21 15:42:32,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376887,376900] [2022-07-21 15:42:32,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377054,377067] [2022-07-21 15:42:32,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377222,377235] [2022-07-21 15:42:32,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377372,377385] [2022-07-21 15:42:32,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377519,377532] [2022-07-21 15:42:32,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377680,377693] [2022-07-21 15:42:32,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377850,377863] [2022-07-21 15:42:32,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[378012,378025] [2022-07-21 15:42:32,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:32,601 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:42:32,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364624,364637] [2022-07-21 15:42:32,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364769,364782] [2022-07-21 15:42:32,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[364915,364928] [2022-07-21 15:42:32,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365080,365093] [2022-07-21 15:42:32,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365238,365251] [2022-07-21 15:42:32,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365396,365409] [2022-07-21 15:42:32,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365554,365567] [2022-07-21 15:42:32,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365714,365727] [2022-07-21 15:42:32,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[365873,365886] [2022-07-21 15:42:32,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366012,366025] [2022-07-21 15:42:32,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366154,366167] [2022-07-21 15:42:32,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366303,366316] [2022-07-21 15:42:32,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366442,366455] [2022-07-21 15:42:32,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366597,366610] [2022-07-21 15:42:32,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366757,366770] [2022-07-21 15:42:32,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[366908,366921] [2022-07-21 15:42:32,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367059,367072] [2022-07-21 15:42:32,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367211,367224] [2022-07-21 15:42:32,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367360,367373] [2022-07-21 15:42:32,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367508,367521] [2022-07-21 15:42:32,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367665,367678] [2022-07-21 15:42:32,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367814,367827] [2022-07-21 15:42:32,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[367970,367983] [2022-07-21 15:42:32,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368123,368136] [2022-07-21 15:42:32,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368269,368282] [2022-07-21 15:42:32,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368412,368425] [2022-07-21 15:42:32,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368564,368577] [2022-07-21 15:42:32,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368710,368723] [2022-07-21 15:42:32,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[368855,368868] [2022-07-21 15:42:32,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369009,369022] [2022-07-21 15:42:32,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369160,369173] [2022-07-21 15:42:32,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369315,369328] [2022-07-21 15:42:32,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369467,369480] [2022-07-21 15:42:32,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369622,369635] [2022-07-21 15:42:32,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369786,369799] [2022-07-21 15:42:32,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[369942,369955] [2022-07-21 15:42:32,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370106,370119] [2022-07-21 15:42:32,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370248,370261] [2022-07-21 15:42:32,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370406,370419] [2022-07-21 15:42:32,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370573,370586] [2022-07-21 15:42:32,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370732,370745] [2022-07-21 15:42:32,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[370891,370904] [2022-07-21 15:42:32,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371040,371053] [2022-07-21 15:42:32,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371187,371200] [2022-07-21 15:42:32,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371326,371339] [2022-07-21 15:42:32,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371489,371502] [2022-07-21 15:42:32,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371655,371668] [2022-07-21 15:42:32,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371819,371832] [2022-07-21 15:42:32,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[371984,371997] [2022-07-21 15:42:32,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372149,372162] [2022-07-21 15:42:32,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372315,372328] [2022-07-21 15:42:32,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372480,372493] [2022-07-21 15:42:32,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372647,372660] [2022-07-21 15:42:32,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372807,372820] [2022-07-21 15:42:32,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[372969,372982] [2022-07-21 15:42:32,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373128,373141] [2022-07-21 15:42:32,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373274,373287] [2022-07-21 15:42:32,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373417,373430] [2022-07-21 15:42:32,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373561,373574] [2022-07-21 15:42:32,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373704,373717] [2022-07-21 15:42:32,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373848,373861] [2022-07-21 15:42:32,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[373989,374002] [2022-07-21 15:42:32,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374127,374140] [2022-07-21 15:42:32,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374285,374298] [2022-07-21 15:42:32,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374444,374457] [2022-07-21 15:42:32,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374600,374613] [2022-07-21 15:42:32,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374749,374762] [2022-07-21 15:42:32,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[374901,374914] [2022-07-21 15:42:32,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375052,375065] [2022-07-21 15:42:32,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375201,375214] [2022-07-21 15:42:32,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375353,375366] [2022-07-21 15:42:32,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375501,375514] [2022-07-21 15:42:32,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375654,375667] [2022-07-21 15:42:32,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375805,375818] [2022-07-21 15:42:32,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[375955,375968] [2022-07-21 15:42:32,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376102,376115] [2022-07-21 15:42:32,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376253,376266] [2022-07-21 15:42:32,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376404,376417] [2022-07-21 15:42:32,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376552,376565] [2022-07-21 15:42:32,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376718,376731] [2022-07-21 15:42:32,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[376887,376900] [2022-07-21 15:42:32,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377054,377067] [2022-07-21 15:42:32,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377222,377235] [2022-07-21 15:42:32,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377372,377385] [2022-07-21 15:42:32,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377519,377532] [2022-07-21 15:42:32,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377680,377693] [2022-07-21 15:42:32,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[377850,377863] [2022-07-21 15:42:32,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i[378012,378025] [2022-07-21 15:42:32,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:42:33,051 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:42:33,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33 WrapperNode [2022-07-21 15:42:33,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:42:33,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:33,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:42:33,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:42:33,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,359 INFO L137 Inliner]: procedures = 599, calls = 2864, calls flagged for inlining = 294, calls inlined = 217, statements flattened = 6442 [2022-07-21 15:42:33,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:42:33,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:42:33,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:42:33,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:42:33,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:42:33,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:42:33,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:42:33,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:42:33,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (1/1) ... [2022-07-21 15:42:33,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:42:33,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:42:33,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:42:33,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:42:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:33,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:42:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:42:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:42:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_get_frame [2022-07-21 15:42:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_get_frame [2022-07-21 15:42:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:42:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:42:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:42:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:42:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:42:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:42:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-21 15:42:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-21 15:42:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_isp116x [2022-07-21 15:42:33,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_isp116x [2022-07-21 15:42:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:42:33,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:42:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:42:33,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:42:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:33,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:42:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_read_reg32 [2022-07-21 15:42:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_read_reg32 [2022-07-21 15:42:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-21 15:42:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-21 15:42:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:42:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_raw_write_data16 [2022-07-21 15:42:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_raw_write_data16 [2022-07-21 15:42:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:42:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:42:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:42:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:42:33,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:42:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:33,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:42:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2022-07-21 15:42:33,718 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2022-07-21 15:42:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:42:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_read_data16 [2022-07-21 15:42:33,719 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_read_data16 [2022-07-21 15:42:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:33,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:42:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:33,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:42:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_122 [2022-07-21 15:42:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_122 [2022-07-21 15:42:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:42:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:42:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_hub_control [2022-07-21 15:42:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_hub_control [2022-07-21 15:42:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_reset [2022-07-21 15:42:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_reset [2022-07-21 15:42:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:42:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_isp116x [2022-07-21 15:42:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_isp116x [2022-07-21 15:42:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:42:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:42:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-21 15:42:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-21 15:42:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:42:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:42:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:42:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:42:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:42:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:42:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:42:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:42:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:42:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:42:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure usb_remove_hcd [2022-07-21 15:42:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_remove_hcd [2022-07-21 15:42:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_bus_resume [2022-07-21 15:42:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_bus_resume [2022-07-21 15:42:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 15:42:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 15:42:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:42:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_start [2022-07-21 15:42:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_start [2022-07-21 15:42:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-21 15:42:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-21 15:42:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:42:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:42:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure finish_request [2022-07-21 15:42:33,724 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_request [2022-07-21 15:42:33,724 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_write_reg16 [2022-07-21 15:42:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_write_reg16 [2022-07-21 15:42:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 15:42:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 15:42:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:42:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:42:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:33,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:42:33,725 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2022-07-21 15:42:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2022-07-21 15:42:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_write_reg32 [2022-07-21 15:42:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_write_reg32 [2022-07-21 15:42:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_sw_reset [2022-07-21 15:42:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_sw_reset [2022-07-21 15:42:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-21 15:42:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-21 15:42:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_isp116x [2022-07-21 15:42:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_isp116x [2022-07-21 15:42:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2022-07-21 15:42:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2022-07-21 15:42:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_write_addr [2022-07-21 15:42:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_write_addr [2022-07-21 15:42:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_to_hcd [2022-07-21 15:42:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_to_hcd [2022-07-21 15:42:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:42:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:42:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:42:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 15:42:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 15:42:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:42:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:42:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del_entry [2022-07-21 15:42:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del_entry [2022-07-21 15:42:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-21 15:42:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-21 15:42:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2022-07-21 15:42:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2022-07-21 15:42:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:42:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:42:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:42:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:42:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure start_atl_transfers [2022-07-21 15:42:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure start_atl_transfers [2022-07-21 15:42:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_hcd [2022-07-21 15:42:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_hcd [2022-07-21 15:42:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_probe [2022-07-21 15:42:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_probe [2022-07-21 15:42:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:42:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:42:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_write_data16 [2022-07-21 15:42:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_write_data16 [2022-07-21 15:42:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-21 15:42:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-21 15:42:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:42:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:42:33,731 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:33,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:42:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:42:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-21 15:42:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-21 15:42:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:42:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:42:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:42:33,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:42:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:42:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:42:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_96 [2022-07-21 15:42:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_96 [2022-07-21 15:42:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_read_reg16 [2022-07-21 15:42:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_read_reg16 [2022-07-21 15:42:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:42:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_95 [2022-07-21 15:42:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_95 [2022-07-21 15:42:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_stop [2022-07-21 15:42:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_stop [2022-07-21 15:42:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_bus_suspend [2022-07-21 15:42:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_bus_suspend [2022-07-21 15:42:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_raw_read_data16 [2022-07-21 15:42:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_raw_read_data16 [2022-07-21 15:42:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:42:33,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:42:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_resume [2022-07-21 15:42:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_resume [2022-07-21 15:42:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:42:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-21 15:42:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-21 15:42:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-21 15:42:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-21 15:42:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_121 [2022-07-21 15:42:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_121 [2022-07-21 15:42:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure isp116x_remove [2022-07-21 15:42:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure isp116x_remove [2022-07-21 15:42:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:42:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-07-21 15:42:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-07-21 15:42:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-21 15:42:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-21 15:42:34,281 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:42:34,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:42:34,508 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:42:37,678 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:42:37,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:42:37,719 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 15:42:37,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:37 BoogieIcfgContainer [2022-07-21 15:42:37,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:42:37,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:42:37,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:42:37,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:42:37,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:42:30" (1/3) ... [2022-07-21 15:42:37,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a186793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:37, skipping insertion in model container [2022-07-21 15:42:37,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:42:33" (2/3) ... [2022-07-21 15:42:37,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a186793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:42:37, skipping insertion in model container [2022-07-21 15:42:37,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:42:37" (3/3) ... [2022-07-21 15:42:37,751 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--isp116x-hcd.ko.cil.i [2022-07-21 15:42:37,763 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:42:37,783 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-21 15:42:37,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:42:37,904 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@124380f9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ad92789 [2022-07-21 15:42:37,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-21 15:42:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 2174 states, 1506 states have (on average 1.3519256308100929) internal successors, (2036), 1575 states have internal predecessors, (2036), 547 states have call successors, (547), 94 states have call predecessors, (547), 93 states have return successors, (540), 532 states have call predecessors, (540), 540 states have call successors, (540) [2022-07-21 15:42:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 15:42:37,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:37,961 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:37,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1848564557, now seen corresponding path program 1 times [2022-07-21 15:42:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:37,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213389191] [2022-07-21 15:42:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:37,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:42:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:42:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:42:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:42:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:42:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:38,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213389191] [2022-07-21 15:42:38,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213389191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:38,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:38,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626571806] [2022-07-21 15:42:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:38,409 INFO L87 Difference]: Start difference. First operand has 2174 states, 1506 states have (on average 1.3519256308100929) internal successors, (2036), 1575 states have internal predecessors, (2036), 547 states have call successors, (547), 94 states have call predecessors, (547), 93 states have return successors, (540), 532 states have call predecessors, (540), 540 states have call successors, (540) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:42:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:47,485 INFO L93 Difference]: Finished difference Result 6444 states and 9590 transitions. [2022-07-21 15:42:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:42:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-21 15:42:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:47,528 INFO L225 Difference]: With dead ends: 6444 [2022-07-21 15:42:47,529 INFO L226 Difference]: Without dead ends: 4262 [2022-07-21 15:42:47,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:42:47,549 INFO L413 NwaCegarLoop]: 2950 mSDtfsCounter, 6873 mSDsluCounter, 3233 mSDsCounter, 0 mSdLazyCounter, 6280 mSolverCounterSat, 4072 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7058 SdHoareTripleChecker+Valid, 6183 SdHoareTripleChecker+Invalid, 10352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4072 IncrementalHoareTripleChecker+Valid, 6280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:47,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7058 Valid, 6183 Invalid, 10352 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4072 Valid, 6280 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-21 15:42:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-07-21 15:42:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4066. [2022-07-21 15:42:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4066 states, 2849 states have (on average 1.2853632853632853) internal successors, (3662), 2950 states have internal predecessors, (3662), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 165 states have return successors, (1050), 1001 states have call predecessors, (1050), 1022 states have call successors, (1050) [2022-07-21 15:42:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 5736 transitions. [2022-07-21 15:42:47,800 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 5736 transitions. Word has length 64 [2022-07-21 15:42:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:47,801 INFO L495 AbstractCegarLoop]: Abstraction has 4066 states and 5736 transitions. [2022-07-21 15:42:47,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:42:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 5736 transitions. [2022-07-21 15:42:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 15:42:47,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:47,809 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:47,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:42:47,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -142027903, now seen corresponding path program 1 times [2022-07-21 15:42:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:47,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403131717] [2022-07-21 15:42:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:42:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:42:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:42:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:42:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:42:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:42:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:48,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403131717] [2022-07-21 15:42:48,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403131717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:48,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:48,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814457351] [2022-07-21 15:42:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:48,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:48,129 INFO L87 Difference]: Start difference. First operand 4066 states and 5736 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:42:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:52,495 INFO L93 Difference]: Finished difference Result 4066 states and 5736 transitions. [2022-07-21 15:42:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:52,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-21 15:42:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:52,520 INFO L225 Difference]: With dead ends: 4066 [2022-07-21 15:42:52,521 INFO L226 Difference]: Without dead ends: 4064 [2022-07-21 15:42:52,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:52,526 INFO L413 NwaCegarLoop]: 2659 mSDtfsCounter, 4527 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:52,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 4955 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 15:42:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2022-07-21 15:42:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 4064. [2022-07-21 15:42:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 2848 states have (on average 1.2851123595505618) internal successors, (3660), 2948 states have internal predecessors, (3660), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 165 states have return successors, (1050), 1001 states have call predecessors, (1050), 1022 states have call successors, (1050) [2022-07-21 15:42:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5734 transitions. [2022-07-21 15:42:52,654 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5734 transitions. Word has length 70 [2022-07-21 15:42:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:52,656 INFO L495 AbstractCegarLoop]: Abstraction has 4064 states and 5734 transitions. [2022-07-21 15:42:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:42:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5734 transitions. [2022-07-21 15:42:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 15:42:52,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:52,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:52,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:42:52,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash -935789184, now seen corresponding path program 1 times [2022-07-21 15:42:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:52,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287279005] [2022-07-21 15:42:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:42:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:42:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:42:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:42:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:42:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:42:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:42:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:52,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:52,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287279005] [2022-07-21 15:42:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287279005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:52,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535260790] [2022-07-21 15:42:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:52,891 INFO L87 Difference]: Start difference. First operand 4064 states and 5734 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:42:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:42:57,260 INFO L93 Difference]: Finished difference Result 4064 states and 5734 transitions. [2022-07-21 15:42:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:42:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-21 15:42:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:42:57,298 INFO L225 Difference]: With dead ends: 4064 [2022-07-21 15:42:57,299 INFO L226 Difference]: Without dead ends: 4062 [2022-07-21 15:42:57,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:42:57,307 INFO L413 NwaCegarLoop]: 2657 mSDtfsCounter, 4521 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 4953 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:42:57,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 4953 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 15:42:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-07-21 15:42:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-07-21 15:42:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 2847 states have (on average 1.2848612574639973) internal successors, (3658), 2946 states have internal predecessors, (3658), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 165 states have return successors, (1050), 1001 states have call predecessors, (1050), 1022 states have call successors, (1050) [2022-07-21 15:42:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5732 transitions. [2022-07-21 15:42:57,425 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5732 transitions. Word has length 76 [2022-07-21 15:42:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:42:57,426 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 5732 transitions. [2022-07-21 15:42:57,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:42:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5732 transitions. [2022-07-21 15:42:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 15:42:57,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:42:57,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:42:57,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:42:57,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:42:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:42:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 244413087, now seen corresponding path program 1 times [2022-07-21 15:42:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:42:57,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756076344] [2022-07-21 15:42:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:42:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:42:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:42:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:42:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:42:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:42:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:42:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:42:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:42:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:42:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:42:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:42:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:42:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:42:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:42:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:42:57,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:42:57,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756076344] [2022-07-21 15:42:57,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756076344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:42:57,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:42:57,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:42:57,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992249613] [2022-07-21 15:42:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:42:57,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:42:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:42:57,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:42:57,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:42:57,665 INFO L87 Difference]: Start difference. First operand 4062 states and 5732 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:43:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:01,954 INFO L93 Difference]: Finished difference Result 4062 states and 5732 transitions. [2022-07-21 15:43:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-21 15:43:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:01,970 INFO L225 Difference]: With dead ends: 4062 [2022-07-21 15:43:01,971 INFO L226 Difference]: Without dead ends: 4060 [2022-07-21 15:43:01,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:01,975 INFO L413 NwaCegarLoop]: 2655 mSDtfsCounter, 4515 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4719 SdHoareTripleChecker+Valid, 4951 SdHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:01,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4719 Valid, 4951 Invalid, 5191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 15:43:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2022-07-21 15:43:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4060. [2022-07-21 15:43:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 2846 states have (on average 1.2846099789177794) internal successors, (3656), 2944 states have internal predecessors, (3656), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 165 states have return successors, (1050), 1001 states have call predecessors, (1050), 1022 states have call successors, (1050) [2022-07-21 15:43:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5730 transitions. [2022-07-21 15:43:02,095 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5730 transitions. Word has length 82 [2022-07-21 15:43:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:02,096 INFO L495 AbstractCegarLoop]: Abstraction has 4060 states and 5730 transitions. [2022-07-21 15:43:02,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:43:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5730 transitions. [2022-07-21 15:43:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 15:43:02,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:02,098 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:02,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:43:02,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -695863825, now seen corresponding path program 1 times [2022-07-21 15:43:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211721870] [2022-07-21 15:43:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:43:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:43:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:43:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:43:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:43:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-21 15:43:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211721870] [2022-07-21 15:43:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211721870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:43:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793548641] [2022-07-21 15:43:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:02,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:43:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:43:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:43:02,300 INFO L87 Difference]: Start difference. First operand 4060 states and 5730 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:43:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:07,117 INFO L93 Difference]: Finished difference Result 8166 states and 11620 transitions. [2022-07-21 15:43:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2022-07-21 15:43:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:07,160 INFO L225 Difference]: With dead ends: 8166 [2022-07-21 15:43:07,161 INFO L226 Difference]: Without dead ends: 4125 [2022-07-21 15:43:07,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:43:07,175 INFO L413 NwaCegarLoop]: 2391 mSDtfsCounter, 5681 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 3853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5918 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 6125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3853 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:07,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5918 Valid, 4441 Invalid, 6125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3853 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-21 15:43:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2022-07-21 15:43:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 4070. [2022-07-21 15:43:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 2852 states have (on average 1.282959326788219) internal successors, (3659), 2951 states have internal predecessors, (3659), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5767 transitions. [2022-07-21 15:43:07,318 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5767 transitions. Word has length 93 [2022-07-21 15:43:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:07,319 INFO L495 AbstractCegarLoop]: Abstraction has 4070 states and 5767 transitions. [2022-07-21 15:43:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:43:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5767 transitions. [2022-07-21 15:43:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 15:43:07,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:07,323 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:07,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:43:07,324 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1544790761, now seen corresponding path program 1 times [2022-07-21 15:43:07,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:07,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844612837] [2022-07-21 15:43:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:07,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844612837] [2022-07-21 15:43:07,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844612837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:07,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:07,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830521713] [2022-07-21 15:43:07,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:07,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:07,473 INFO L87 Difference]: Start difference. First operand 4070 states and 5767 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:43:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:11,125 INFO L93 Difference]: Finished difference Result 4070 states and 5767 transitions. [2022-07-21 15:43:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-21 15:43:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:11,155 INFO L225 Difference]: With dead ends: 4070 [2022-07-21 15:43:11,155 INFO L226 Difference]: Without dead ends: 4068 [2022-07-21 15:43:11,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:11,160 INFO L413 NwaCegarLoop]: 2648 mSDtfsCounter, 4504 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 2824 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 4930 SdHoareTripleChecker+Invalid, 5188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:11,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4707 Valid, 4930 Invalid, 5188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2824 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-21 15:43:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2022-07-21 15:43:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 4068. [2022-07-21 15:43:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4068 states, 2851 states have (on average 1.2827078218169063) internal successors, (3657), 2949 states have internal predecessors, (3657), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 5765 transitions. [2022-07-21 15:43:11,328 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 5765 transitions. Word has length 88 [2022-07-21 15:43:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:11,329 INFO L495 AbstractCegarLoop]: Abstraction has 4068 states and 5765 transitions. [2022-07-21 15:43:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:43:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 5765 transitions. [2022-07-21 15:43:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 15:43:11,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:11,330 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:11,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:43:11,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1666143650, now seen corresponding path program 1 times [2022-07-21 15:43:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:11,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58488615] [2022-07-21 15:43:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:43:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:43:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:43:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:43:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:43:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:43:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 15:43:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58488615] [2022-07-21 15:43:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58488615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:43:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072831365] [2022-07-21 15:43:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:43:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:43:11,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:43:11,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:43:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:12,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 2933 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:43:12,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:43:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-21 15:43:12,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:43:12,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072831365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:12,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:43:12,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 15:43:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416766497] [2022-07-21 15:43:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:12,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:43:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:43:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:43:12,400 INFO L87 Difference]: Start difference. First operand 4068 states and 5765 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:43:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:12,546 INFO L93 Difference]: Finished difference Result 8111 states and 11495 transitions. [2022-07-21 15:43:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:43:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2022-07-21 15:43:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:12,577 INFO L225 Difference]: With dead ends: 8111 [2022-07-21 15:43:12,577 INFO L226 Difference]: Without dead ends: 4062 [2022-07-21 15:43:12,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:43:12,590 INFO L413 NwaCegarLoop]: 2966 mSDtfsCounter, 2946 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:12,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 2966 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:43:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-07-21 15:43:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-07-21 15:43:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 2846 states have (on average 1.281799016163036) internal successors, (3648), 2943 states have internal predecessors, (3648), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5756 transitions. [2022-07-21 15:43:12,709 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5756 transitions. Word has length 99 [2022-07-21 15:43:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:12,709 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 5756 transitions. [2022-07-21 15:43:12,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:43:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5756 transitions. [2022-07-21 15:43:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 15:43:12,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:12,711 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:12,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:43:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:43:12,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1455323324, now seen corresponding path program 1 times [2022-07-21 15:43:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:12,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842826192] [2022-07-21 15:43:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:13,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842826192] [2022-07-21 15:43:13,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842826192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:13,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:13,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:13,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061825708] [2022-07-21 15:43:13,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:13,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:13,115 INFO L87 Difference]: Start difference. First operand 4062 states and 5756 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:43:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:17,302 INFO L93 Difference]: Finished difference Result 4062 states and 5756 transitions. [2022-07-21 15:43:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-21 15:43:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:17,313 INFO L225 Difference]: With dead ends: 4062 [2022-07-21 15:43:17,313 INFO L226 Difference]: Without dead ends: 4060 [2022-07-21 15:43:17,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:17,315 INFO L413 NwaCegarLoop]: 2641 mSDtfsCounter, 4493 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 4909 SdHoareTripleChecker+Invalid, 5185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:17,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 4909 Invalid, 5185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-21 15:43:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2022-07-21 15:43:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4060. [2022-07-21 15:43:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 2845 states have (on average 1.2815465729349735) internal successors, (3646), 2941 states have internal predecessors, (3646), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5754 transitions. [2022-07-21 15:43:17,430 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5754 transitions. Word has length 94 [2022-07-21 15:43:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:17,431 INFO L495 AbstractCegarLoop]: Abstraction has 4060 states and 5754 transitions. [2022-07-21 15:43:17,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:43:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5754 transitions. [2022-07-21 15:43:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 15:43:17,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:17,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:43:17,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1045717938, now seen corresponding path program 1 times [2022-07-21 15:43:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:17,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344971742] [2022-07-21 15:43:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:17,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344971742] [2022-07-21 15:43:17,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344971742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:17,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:17,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572245279] [2022-07-21 15:43:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:17,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:17,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:17,640 INFO L87 Difference]: Start difference. First operand 4060 states and 5754 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:43:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:22,127 INFO L93 Difference]: Finished difference Result 4060 states and 5754 transitions. [2022-07-21 15:43:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-21 15:43:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:22,138 INFO L225 Difference]: With dead ends: 4060 [2022-07-21 15:43:22,138 INFO L226 Difference]: Without dead ends: 4058 [2022-07-21 15:43:22,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:22,142 INFO L413 NwaCegarLoop]: 2639 mSDtfsCounter, 4487 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 4907 SdHoareTripleChecker+Invalid, 5183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:22,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 4907 Invalid, 5183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-21 15:43:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-07-21 15:43:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4058. [2022-07-21 15:43:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 2844 states have (on average 1.2812939521800282) internal successors, (3644), 2939 states have internal predecessors, (3644), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 5752 transitions. [2022-07-21 15:43:22,274 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 5752 transitions. Word has length 100 [2022-07-21 15:43:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:22,275 INFO L495 AbstractCegarLoop]: Abstraction has 4058 states and 5752 transitions. [2022-07-21 15:43:22,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:43:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5752 transitions. [2022-07-21 15:43:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 15:43:22,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:22,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:22,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:43:22,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -181816679, now seen corresponding path program 1 times [2022-07-21 15:43:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:22,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7076118] [2022-07-21 15:43:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:22,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7076118] [2022-07-21 15:43:22,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7076118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:22,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:22,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258244137] [2022-07-21 15:43:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:22,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:22,430 INFO L87 Difference]: Start difference. First operand 4058 states and 5752 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:27,095 INFO L93 Difference]: Finished difference Result 4058 states and 5752 transitions. [2022-07-21 15:43:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-21 15:43:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:27,141 INFO L225 Difference]: With dead ends: 4058 [2022-07-21 15:43:27,141 INFO L226 Difference]: Without dead ends: 4056 [2022-07-21 15:43:27,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:27,146 INFO L413 NwaCegarLoop]: 2637 mSDtfsCounter, 4485 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 4905 SdHoareTripleChecker+Invalid, 5177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:27,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 4905 Invalid, 5177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:43:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2022-07-21 15:43:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 4056. [2022-07-21 15:43:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 2843 states have (on average 1.2810411537108688) internal successors, (3642), 2937 states have internal predecessors, (3642), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5750 transitions. [2022-07-21 15:43:27,389 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5750 transitions. Word has length 106 [2022-07-21 15:43:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:27,390 INFO L495 AbstractCegarLoop]: Abstraction has 4056 states and 5750 transitions. [2022-07-21 15:43:27,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5750 transitions. [2022-07-21 15:43:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 15:43:27,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:27,391 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:27,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:43:27,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1367965404, now seen corresponding path program 1 times [2022-07-21 15:43:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:27,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441048578] [2022-07-21 15:43:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441048578] [2022-07-21 15:43:27,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441048578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:27,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:27,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617084752] [2022-07-21 15:43:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:27,565 INFO L87 Difference]: Start difference. First operand 4056 states and 5750 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:31,999 INFO L93 Difference]: Finished difference Result 4056 states and 5750 transitions. [2022-07-21 15:43:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:32,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-21 15:43:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:32,039 INFO L225 Difference]: With dead ends: 4056 [2022-07-21 15:43:32,039 INFO L226 Difference]: Without dead ends: 4054 [2022-07-21 15:43:32,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:32,043 INFO L413 NwaCegarLoop]: 2635 mSDtfsCounter, 4473 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2815 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 4903 SdHoareTripleChecker+Invalid, 5179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:32,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 4903 Invalid, 5179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2815 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 15:43:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2022-07-21 15:43:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4054. [2022-07-21 15:43:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 2842 states have (on average 1.2807881773399015) internal successors, (3640), 2935 states have internal predecessors, (3640), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5748 transitions. [2022-07-21 15:43:32,257 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5748 transitions. Word has length 108 [2022-07-21 15:43:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:32,258 INFO L495 AbstractCegarLoop]: Abstraction has 4054 states and 5748 transitions. [2022-07-21 15:43:32,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:43:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5748 transitions. [2022-07-21 15:43:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 15:43:32,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:32,260 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:32,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:43:32,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1034797214, now seen corresponding path program 1 times [2022-07-21 15:43:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:32,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270137668] [2022-07-21 15:43:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:43:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270137668] [2022-07-21 15:43:32,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270137668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:32,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:32,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306764526] [2022-07-21 15:43:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:32,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:32,469 INFO L87 Difference]: Start difference. First operand 4054 states and 5748 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:43:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:37,786 INFO L93 Difference]: Finished difference Result 4054 states and 5748 transitions. [2022-07-21 15:43:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-21 15:43:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:37,817 INFO L225 Difference]: With dead ends: 4054 [2022-07-21 15:43:37,831 INFO L226 Difference]: Without dead ends: 4052 [2022-07-21 15:43:37,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:37,847 INFO L413 NwaCegarLoop]: 2633 mSDtfsCounter, 4469 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4668 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 5177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:37,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4668 Valid, 4901 Invalid, 5177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 15:43:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2022-07-21 15:43:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 4052. [2022-07-21 15:43:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4052 states, 2841 states have (on average 1.2805350228792678) internal successors, (3638), 2933 states have internal predecessors, (3638), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 5746 transitions. [2022-07-21 15:43:38,130 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 5746 transitions. Word has length 114 [2022-07-21 15:43:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:38,131 INFO L495 AbstractCegarLoop]: Abstraction has 4052 states and 5746 transitions. [2022-07-21 15:43:38,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:43:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 5746 transitions. [2022-07-21 15:43:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:43:38,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:38,133 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:38,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:43:38,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1746653990, now seen corresponding path program 1 times [2022-07-21 15:43:38,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:38,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448621670] [2022-07-21 15:43:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:43:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:43:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448621670] [2022-07-21 15:43:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448621670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:38,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:38,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453673768] [2022-07-21 15:43:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:38,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:38,342 INFO L87 Difference]: Start difference. First operand 4052 states and 5746 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:43:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:43,003 INFO L93 Difference]: Finished difference Result 4052 states and 5746 transitions. [2022-07-21 15:43:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-21 15:43:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:43,042 INFO L225 Difference]: With dead ends: 4052 [2022-07-21 15:43:43,043 INFO L226 Difference]: Without dead ends: 4050 [2022-07-21 15:43:43,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:43,046 INFO L413 NwaCegarLoop]: 2631 mSDtfsCounter, 4463 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 4899 SdHoareTripleChecker+Invalid, 5175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:43,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 4899 Invalid, 5175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:43:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2022-07-21 15:43:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 4050. [2022-07-21 15:43:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 2840 states have (on average 1.2802816901408451) internal successors, (3636), 2931 states have internal predecessors, (3636), 1024 states have call successors, (1024), 166 states have call predecessors, (1024), 170 states have return successors, (1084), 1004 states have call predecessors, (1084), 1022 states have call successors, (1084) [2022-07-21 15:43:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 5744 transitions. [2022-07-21 15:43:43,210 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 5744 transitions. Word has length 120 [2022-07-21 15:43:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:43,211 INFO L495 AbstractCegarLoop]: Abstraction has 4050 states and 5744 transitions. [2022-07-21 15:43:43,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:43:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 5744 transitions. [2022-07-21 15:43:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-21 15:43:43,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:43,213 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:43:43,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1435109373, now seen corresponding path program 1 times [2022-07-21 15:43:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:43,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654837306] [2022-07-21 15:43:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:43:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:43:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:43:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:43:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:43:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:43:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:43:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:43:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:43:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-07-21 15:43:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:43,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654837306] [2022-07-21 15:43:43,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654837306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:43,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:43,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:43:43,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314275085] [2022-07-21 15:43:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:43,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:43:43,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:43:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:43:43,495 INFO L87 Difference]: Start difference. First operand 4050 states and 5744 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:53,687 INFO L93 Difference]: Finished difference Result 4179 states and 5949 transitions. [2022-07-21 15:43:53,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:43:53,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2022-07-21 15:43:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:53,709 INFO L225 Difference]: With dead ends: 4179 [2022-07-21 15:43:53,709 INFO L226 Difference]: Without dead ends: 4177 [2022-07-21 15:43:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:43:53,711 INFO L413 NwaCegarLoop]: 2623 mSDtfsCounter, 4252 mSDsluCounter, 4189 mSDsCounter, 0 mSdLazyCounter, 6965 mSolverCounterSat, 2839 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 6812 SdHoareTripleChecker+Invalid, 9804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2839 IncrementalHoareTripleChecker+Valid, 6965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:53,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4364 Valid, 6812 Invalid, 9804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2839 Valid, 6965 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-07-21 15:43:53,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2022-07-21 15:43:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4126. [2022-07-21 15:43:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 2889 states have (on average 1.2748355832467981) internal successors, (3683), 2979 states have internal predecessors, (3683), 1030 states have call successors, (1030), 188 states have call predecessors, (1030), 192 states have return successors, (1090), 1010 states have call predecessors, (1090), 1028 states have call successors, (1090) [2022-07-21 15:43:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5803 transitions. [2022-07-21 15:43:53,848 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5803 transitions. Word has length 167 [2022-07-21 15:43:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:53,849 INFO L495 AbstractCegarLoop]: Abstraction has 4126 states and 5803 transitions. [2022-07-21 15:43:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5803 transitions. [2022-07-21 15:43:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 15:43:53,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:53,850 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:53,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:43:53,851 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1091540757, now seen corresponding path program 1 times [2022-07-21 15:43:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:53,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056561556] [2022-07-21 15:43:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:43:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:43:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:43:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056561556] [2022-07-21 15:43:54,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056561556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:54,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:54,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878065532] [2022-07-21 15:43:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:54,008 INFO L87 Difference]: Start difference. First operand 4126 states and 5803 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:43:58,708 INFO L93 Difference]: Finished difference Result 4126 states and 5803 transitions. [2022-07-21 15:43:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:43:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-21 15:43:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:43:58,723 INFO L225 Difference]: With dead ends: 4126 [2022-07-21 15:43:58,723 INFO L226 Difference]: Without dead ends: 4124 [2022-07-21 15:43:58,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:43:58,725 INFO L413 NwaCegarLoop]: 2627 mSDtfsCounter, 4451 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4648 SdHoareTripleChecker+Valid, 4895 SdHoareTripleChecker+Invalid, 5171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:43:58,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4648 Valid, 4895 Invalid, 5171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-21 15:43:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2022-07-21 15:43:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4124. [2022-07-21 15:43:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 2888 states have (on average 1.274584487534626) internal successors, (3681), 2977 states have internal predecessors, (3681), 1030 states have call successors, (1030), 188 states have call predecessors, (1030), 192 states have return successors, (1090), 1010 states have call predecessors, (1090), 1028 states have call successors, (1090) [2022-07-21 15:43:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 5801 transitions. [2022-07-21 15:43:58,880 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 5801 transitions. Word has length 126 [2022-07-21 15:43:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:43:58,880 INFO L495 AbstractCegarLoop]: Abstraction has 4124 states and 5801 transitions. [2022-07-21 15:43:58,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:43:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 5801 transitions. [2022-07-21 15:43:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 15:43:58,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:43:58,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:43:58,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:43:58,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:43:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:43:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash -496280260, now seen corresponding path program 1 times [2022-07-21 15:43:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:43:58,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636385954] [2022-07-21 15:43:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:43:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:43:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:43:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:43:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:43:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:43:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:43:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:43:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:43:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:43:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:43:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:43:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:43:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:43:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:43:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:43:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:43:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:43:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:43:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:43:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:43:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:43:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:43:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:43:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:43:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636385954] [2022-07-21 15:43:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636385954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:43:59,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:43:59,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:43:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970127325] [2022-07-21 15:43:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:43:59,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:43:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:43:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:43:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:43:59,043 INFO L87 Difference]: Start difference. First operand 4124 states and 5801 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:44:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:04,407 INFO L93 Difference]: Finished difference Result 4124 states and 5801 transitions. [2022-07-21 15:44:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-21 15:44:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:04,417 INFO L225 Difference]: With dead ends: 4124 [2022-07-21 15:44:04,417 INFO L226 Difference]: Without dead ends: 4122 [2022-07-21 15:44:04,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:04,419 INFO L413 NwaCegarLoop]: 2625 mSDtfsCounter, 4445 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4641 SdHoareTripleChecker+Valid, 4893 SdHoareTripleChecker+Invalid, 5169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:04,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4641 Valid, 4893 Invalid, 5169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:44:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2022-07-21 15:44:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 4122. [2022-07-21 15:44:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 2887 states have (on average 1.2743332178732247) internal successors, (3679), 2975 states have internal predecessors, (3679), 1030 states have call successors, (1030), 188 states have call predecessors, (1030), 192 states have return successors, (1090), 1010 states have call predecessors, (1090), 1028 states have call successors, (1090) [2022-07-21 15:44:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 5799 transitions. [2022-07-21 15:44:04,584 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 5799 transitions. Word has length 132 [2022-07-21 15:44:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:04,586 INFO L495 AbstractCegarLoop]: Abstraction has 4122 states and 5799 transitions. [2022-07-21 15:44:04,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:44:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 5799 transitions. [2022-07-21 15:44:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 15:44:04,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:04,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:04,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:44:04,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:44:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 522974862, now seen corresponding path program 1 times [2022-07-21 15:44:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:04,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525613412] [2022-07-21 15:44:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:44:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:44:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:44:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:44:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:44:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:44:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:44:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:44:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:44:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:44:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:44:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:44:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:04,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525613412] [2022-07-21 15:44:04,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525613412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:04,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:04,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:04,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211856556] [2022-07-21 15:44:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:04,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:04,771 INFO L87 Difference]: Start difference. First operand 4122 states and 5799 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:44:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:09,049 INFO L93 Difference]: Finished difference Result 4122 states and 5799 transitions. [2022-07-21 15:44:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-21 15:44:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:09,060 INFO L225 Difference]: With dead ends: 4122 [2022-07-21 15:44:09,060 INFO L226 Difference]: Without dead ends: 4120 [2022-07-21 15:44:09,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:09,061 INFO L413 NwaCegarLoop]: 2623 mSDtfsCounter, 4439 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4634 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 5167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:09,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4634 Valid, 4891 Invalid, 5167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 15:44:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2022-07-21 15:44:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2022-07-21 15:44:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 2886 states have (on average 1.274081774081774) internal successors, (3677), 2973 states have internal predecessors, (3677), 1030 states have call successors, (1030), 188 states have call predecessors, (1030), 192 states have return successors, (1090), 1010 states have call predecessors, (1090), 1028 states have call successors, (1090) [2022-07-21 15:44:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 5797 transitions. [2022-07-21 15:44:09,327 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 5797 transitions. Word has length 138 [2022-07-21 15:44:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:09,327 INFO L495 AbstractCegarLoop]: Abstraction has 4120 states and 5797 transitions. [2022-07-21 15:44:09,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:44:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 5797 transitions. [2022-07-21 15:44:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 15:44:09,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:09,334 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:09,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:44:09,335 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:44:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 236185974, now seen corresponding path program 1 times [2022-07-21 15:44:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540111975] [2022-07-21 15:44:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:09,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:44:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:44:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:44:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:44:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 15:44:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:44:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 15:44:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:44:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-21 15:44:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540111975] [2022-07-21 15:44:09,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540111975] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:44:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725660102] [2022-07-21 15:44:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:44:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:09,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:44:09,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 15:44:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:10,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 15:44:10,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:44:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-21 15:44:11,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:44:11,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725660102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:11,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:44:11,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2022-07-21 15:44:11,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941617058] [2022-07-21 15:44:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:11,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 15:44:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:11,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 15:44:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2022-07-21 15:44:11,017 INFO L87 Difference]: Start difference. First operand 4120 states and 5797 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-21 15:44:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:12,349 INFO L93 Difference]: Finished difference Result 9355 states and 13288 transitions. [2022-07-21 15:44:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:44:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 157 [2022-07-21 15:44:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:12,366 INFO L225 Difference]: With dead ends: 9355 [2022-07-21 15:44:12,366 INFO L226 Difference]: Without dead ends: 5252 [2022-07-21 15:44:12,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 15:44:12,381 INFO L413 NwaCegarLoop]: 3769 mSDtfsCounter, 3090 mSDsluCounter, 44827 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 48596 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1073 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:12,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 48596 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1073 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 15:44:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2022-07-21 15:44:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4154. [2022-07-21 15:44:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 2910 states have (on average 1.2718213058419243) internal successors, (3701), 2997 states have internal predecessors, (3701), 1038 states have call successors, (1038), 188 states have call predecessors, (1038), 194 states have return successors, (1102), 1020 states have call predecessors, (1102), 1036 states have call successors, (1102) [2022-07-21 15:44:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 5841 transitions. [2022-07-21 15:44:12,709 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 5841 transitions. Word has length 157 [2022-07-21 15:44:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:12,710 INFO L495 AbstractCegarLoop]: Abstraction has 4154 states and 5841 transitions. [2022-07-21 15:44:12,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (23), 2 states have call predecessors, (23), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-21 15:44:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 5841 transitions. [2022-07-21 15:44:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 15:44:12,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:12,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:12,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 15:44:12,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 15:44:12,927 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:44:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:12,928 INFO L85 PathProgramCache]: Analyzing trace with hash -630646689, now seen corresponding path program 1 times [2022-07-21 15:44:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:12,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974965266] [2022-07-21 15:44:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:44:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:44:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:44:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:44:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:44:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:44:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:44:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:44:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:44:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:44:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:44:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:44:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:44:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:44:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:44:13,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:13,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974965266] [2022-07-21 15:44:13,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974965266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:13,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:13,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:13,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760307542] [2022-07-21 15:44:13,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:13,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:13,137 INFO L87 Difference]: Start difference. First operand 4154 states and 5841 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:44:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:18,550 INFO L93 Difference]: Finished difference Result 4154 states and 5841 transitions. [2022-07-21 15:44:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-21 15:44:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:18,563 INFO L225 Difference]: With dead ends: 4154 [2022-07-21 15:44:18,564 INFO L226 Difference]: Without dead ends: 4152 [2022-07-21 15:44:18,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:18,568 INFO L413 NwaCegarLoop]: 2621 mSDtfsCounter, 4433 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 4889 SdHoareTripleChecker+Invalid, 5165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:18,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4627 Valid, 4889 Invalid, 5165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:44:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2022-07-21 15:44:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4152. [2022-07-21 15:44:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 2909 states have (on average 1.2715709865933311) internal successors, (3699), 2995 states have internal predecessors, (3699), 1038 states have call successors, (1038), 188 states have call predecessors, (1038), 194 states have return successors, (1102), 1020 states have call predecessors, (1102), 1036 states have call successors, (1102) [2022-07-21 15:44:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5839 transitions. [2022-07-21 15:44:18,884 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5839 transitions. Word has length 144 [2022-07-21 15:44:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:18,885 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 5839 transitions. [2022-07-21 15:44:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:44:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5839 transitions. [2022-07-21 15:44:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 15:44:18,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:18,887 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:18,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:44:18,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:44:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1287458638, now seen corresponding path program 1 times [2022-07-21 15:44:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357929989] [2022-07-21 15:44:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:44:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:44:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:44:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:44:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:44:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:44:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 15:44:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:44:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:44:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:44:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 15:44:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-21 15:44:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:19,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357929989] [2022-07-21 15:44:19,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357929989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:19,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:19,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-21 15:44:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683852832] [2022-07-21 15:44:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:19,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 15:44:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 15:44:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:44:19,354 INFO L87 Difference]: Start difference. First operand 4152 states and 5839 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-21 15:45:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:02,839 INFO L93 Difference]: Finished difference Result 10044 states and 14408 transitions. [2022-07-21 15:45:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 15:45:02,840 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 159 [2022-07-21 15:45:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:02,853 INFO L225 Difference]: With dead ends: 10044 [2022-07-21 15:45:02,853 INFO L226 Difference]: Without dead ends: 5909 [2022-07-21 15:45:02,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1572, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 15:45:02,865 INFO L413 NwaCegarLoop]: 4234 mSDtfsCounter, 6151 mSDsluCounter, 33951 mSDsCounter, 0 mSdLazyCounter, 37826 mSolverCounterSat, 3650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6328 SdHoareTripleChecker+Valid, 38185 SdHoareTripleChecker+Invalid, 41476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3650 IncrementalHoareTripleChecker+Valid, 37826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:02,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6328 Valid, 38185 Invalid, 41476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3650 Valid, 37826 Invalid, 0 Unknown, 0 Unchecked, 42.1s Time] [2022-07-21 15:45:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5909 states. [2022-07-21 15:45:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 4170. [2022-07-21 15:45:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 2920 states have (on average 1.2705479452054795) internal successors, (3710), 3008 states have internal predecessors, (3710), 1044 states have call successors, (1044), 188 states have call predecessors, (1044), 195 states have return successors, (1112), 1025 states have call predecessors, (1112), 1042 states have call successors, (1112) [2022-07-21 15:45:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5866 transitions. [2022-07-21 15:45:03,117 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5866 transitions. Word has length 159 [2022-07-21 15:45:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:03,117 INFO L495 AbstractCegarLoop]: Abstraction has 4170 states and 5866 transitions. [2022-07-21 15:45:03,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 14 states have internal predecessors, (75), 6 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-21 15:45:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5866 transitions. [2022-07-21 15:45:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-21 15:45:03,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:03,119 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:03,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:45:03,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:45:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 281262608, now seen corresponding path program 1 times [2022-07-21 15:45:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:03,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976449581] [2022-07-21 15:45:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:45:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:45:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:45:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:45:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:45:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:45:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:45:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:45:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:45:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:45:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:45:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:45:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:45:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:45:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:45:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:45:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:45:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:03,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976449581] [2022-07-21 15:45:03,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976449581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:03,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428797779] [2022-07-21 15:45:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:03,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:03,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:03,305 INFO L87 Difference]: Start difference. First operand 4170 states and 5866 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:08,763 INFO L93 Difference]: Finished difference Result 4170 states and 5866 transitions. [2022-07-21 15:45:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-21 15:45:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:08,780 INFO L225 Difference]: With dead ends: 4170 [2022-07-21 15:45:08,780 INFO L226 Difference]: Without dead ends: 4168 [2022-07-21 15:45:08,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:08,787 INFO L413 NwaCegarLoop]: 2619 mSDtfsCounter, 4427 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:08,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 4887 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:45:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2022-07-21 15:45:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4168. [2022-07-21 15:45:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 2919 states have (on average 1.2702980472764644) internal successors, (3708), 3006 states have internal predecessors, (3708), 1044 states have call successors, (1044), 188 states have call predecessors, (1044), 195 states have return successors, (1112), 1025 states have call predecessors, (1112), 1042 states have call successors, (1112) [2022-07-21 15:45:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5864 transitions. [2022-07-21 15:45:09,059 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5864 transitions. Word has length 150 [2022-07-21 15:45:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:09,059 INFO L495 AbstractCegarLoop]: Abstraction has 4168 states and 5864 transitions. [2022-07-21 15:45:09,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5864 transitions. [2022-07-21 15:45:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 15:45:09,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:09,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:09,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:45:09,062 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:45:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2100319840, now seen corresponding path program 1 times [2022-07-21 15:45:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358388539] [2022-07-21 15:45:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:45:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:45:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:45:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:45:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:45:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:45:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:45:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:45:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:45:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:45:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:45:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:45:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:45:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:45:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:45:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:45:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:45:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:45:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:45:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:09,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358388539] [2022-07-21 15:45:09,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358388539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:09,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:09,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107383886] [2022-07-21 15:45:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:09,256 INFO L87 Difference]: Start difference. First operand 4168 states and 5864 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:45:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:14,944 INFO L93 Difference]: Finished difference Result 4168 states and 5864 transitions. [2022-07-21 15:45:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-21 15:45:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:14,958 INFO L225 Difference]: With dead ends: 4168 [2022-07-21 15:45:14,958 INFO L226 Difference]: Without dead ends: 4166 [2022-07-21 15:45:14,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:14,963 INFO L413 NwaCegarLoop]: 2617 mSDtfsCounter, 4421 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4613 SdHoareTripleChecker+Valid, 4885 SdHoareTripleChecker+Invalid, 5161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:14,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4613 Valid, 4885 Invalid, 5161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 15:45:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2022-07-21 15:45:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4166. [2022-07-21 15:45:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 2918 states have (on average 1.2700479780671694) internal successors, (3706), 3004 states have internal predecessors, (3706), 1044 states have call successors, (1044), 188 states have call predecessors, (1044), 195 states have return successors, (1112), 1025 states have call predecessors, (1112), 1042 states have call successors, (1112) [2022-07-21 15:45:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 5862 transitions. [2022-07-21 15:45:15,299 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 5862 transitions. Word has length 156 [2022-07-21 15:45:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:15,299 INFO L495 AbstractCegarLoop]: Abstraction has 4166 states and 5862 transitions. [2022-07-21 15:45:15,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:45:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 5862 transitions. [2022-07-21 15:45:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-21 15:45:15,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:15,301 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:15,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:45:15,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:45:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1526254024, now seen corresponding path program 1 times [2022-07-21 15:45:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:15,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897127592] [2022-07-21 15:45:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:45:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:45:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:45:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:45:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:45:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:45:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:45:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 15:45:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 15:45:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:45:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 15:45:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-21 15:45:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897127592] [2022-07-21 15:45:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897127592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781932897] [2022-07-21 15:45:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:15,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:15,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 15:45:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:16,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 3402 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 15:45:16,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 99 proven. 10 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-07-21 15:45:16,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:45:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-21 15:45:16,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781932897] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:45:16,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:45:16,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 18 [2022-07-21 15:45:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809062677] [2022-07-21 15:45:16,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:45:16,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 15:45:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 15:45:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:45:16,818 INFO L87 Difference]: Start difference. First operand 4166 states and 5862 transitions. Second operand has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 9 states have internal predecessors, (109), 5 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (37), 10 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-21 15:46:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:01,876 INFO L93 Difference]: Finished difference Result 8410 states and 11991 transitions. [2022-07-21 15:46:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:46:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 9 states have internal predecessors, (109), 5 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (37), 10 states have call predecessors, (37), 5 states have call successors, (37) Word has length 202 [2022-07-21 15:46:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:01,901 INFO L225 Difference]: With dead ends: 8410 [2022-07-21 15:46:01,901 INFO L226 Difference]: Without dead ends: 4263 [2022-07-21 15:46:01,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:46:01,924 INFO L413 NwaCegarLoop]: 2610 mSDtfsCounter, 3708 mSDsluCounter, 11058 mSDsCounter, 0 mSdLazyCounter, 22418 mSolverCounterSat, 3206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3708 SdHoareTripleChecker+Valid, 13668 SdHoareTripleChecker+Invalid, 25624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3206 IncrementalHoareTripleChecker+Valid, 22418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:01,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3708 Valid, 13668 Invalid, 25624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3206 Valid, 22418 Invalid, 0 Unknown, 0 Unchecked, 44.1s Time] [2022-07-21 15:46:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2022-07-21 15:46:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4187. [2022-07-21 15:46:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 2932 states have (on average 1.2687585266030013) internal successors, (3720), 3017 states have internal predecessors, (3720), 1048 states have call successors, (1048), 188 states have call predecessors, (1048), 198 states have return successors, (1133), 1033 states have call predecessors, (1133), 1046 states have call successors, (1133) [2022-07-21 15:46:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 5901 transitions. [2022-07-21 15:46:02,225 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 5901 transitions. Word has length 202 [2022-07-21 15:46:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:02,225 INFO L495 AbstractCegarLoop]: Abstraction has 4187 states and 5901 transitions. [2022-07-21 15:46:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.055555555555555) internal successors, (109), 9 states have internal predecessors, (109), 5 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (37), 10 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-21 15:46:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 5901 transitions. [2022-07-21 15:46:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 15:46:02,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:02,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:02,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 15:46:02,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:02,436 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 170844668, now seen corresponding path program 1 times [2022-07-21 15:46:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552560870] [2022-07-21 15:46:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:46:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:46:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:46:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:46:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:46:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:46:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:46:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:46:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:46:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:46:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:46:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:46:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:46:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:46:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:46:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:46:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:02,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552560870] [2022-07-21 15:46:02,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552560870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:02,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87937201] [2022-07-21 15:46:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:02,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:02,653 INFO L87 Difference]: Start difference. First operand 4187 states and 5901 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:46:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:07,996 INFO L93 Difference]: Finished difference Result 4187 states and 5901 transitions. [2022-07-21 15:46:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-21 15:46:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:08,010 INFO L225 Difference]: With dead ends: 4187 [2022-07-21 15:46:08,010 INFO L226 Difference]: Without dead ends: 4185 [2022-07-21 15:46:08,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:08,014 INFO L413 NwaCegarLoop]: 2615 mSDtfsCounter, 4415 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 5159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:08,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 4883 Invalid, 5159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-21 15:46:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2022-07-21 15:46:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2022-07-21 15:46:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 2931 states have (on average 1.2685090412828386) internal successors, (3718), 3015 states have internal predecessors, (3718), 1048 states have call successors, (1048), 188 states have call predecessors, (1048), 198 states have return successors, (1133), 1033 states have call predecessors, (1133), 1046 states have call successors, (1133) [2022-07-21 15:46:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5899 transitions. [2022-07-21 15:46:08,274 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5899 transitions. Word has length 162 [2022-07-21 15:46:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:08,274 INFO L495 AbstractCegarLoop]: Abstraction has 4185 states and 5899 transitions. [2022-07-21 15:46:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:46:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5899 transitions. [2022-07-21 15:46:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 15:46:08,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:08,276 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:08,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:46:08,277 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash 147387479, now seen corresponding path program 1 times [2022-07-21 15:46:08,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:08,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121972459] [2022-07-21 15:46:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:46:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:46:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:46:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:46:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:46:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:46:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:46:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:46:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:46:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:46:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:46:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:46:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:46:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:46:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:46:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:46:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:46:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121972459] [2022-07-21 15:46:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121972459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483882469] [2022-07-21 15:46:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:08,513 INFO L87 Difference]: Start difference. First operand 4185 states and 5899 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:46:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:13,983 INFO L93 Difference]: Finished difference Result 4185 states and 5899 transitions. [2022-07-21 15:46:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-21 15:46:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:13,994 INFO L225 Difference]: With dead ends: 4185 [2022-07-21 15:46:13,994 INFO L226 Difference]: Without dead ends: 4183 [2022-07-21 15:46:13,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:13,995 INFO L413 NwaCegarLoop]: 2613 mSDtfsCounter, 4409 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2793 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4599 SdHoareTripleChecker+Valid, 4881 SdHoareTripleChecker+Invalid, 5157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:14,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4599 Valid, 4881 Invalid, 5157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2793 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:46:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4183 states. [2022-07-21 15:46:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4183 to 4183. [2022-07-21 15:46:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4183 states, 2930 states have (on average 1.268259385665529) internal successors, (3716), 3013 states have internal predecessors, (3716), 1048 states have call successors, (1048), 188 states have call predecessors, (1048), 198 states have return successors, (1133), 1033 states have call predecessors, (1133), 1046 states have call successors, (1133) [2022-07-21 15:46:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5897 transitions. [2022-07-21 15:46:14,312 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5897 transitions. Word has length 168 [2022-07-21 15:46:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:14,312 INFO L495 AbstractCegarLoop]: Abstraction has 4183 states and 5897 transitions. [2022-07-21 15:46:14,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:46:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5897 transitions. [2022-07-21 15:46:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 15:46:14,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:14,330 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:14,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:46:14,330 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1810037308, now seen corresponding path program 1 times [2022-07-21 15:46:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:14,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273746159] [2022-07-21 15:46:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:46:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:46:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:46:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:46:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:46:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:46:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:46:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:46:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:46:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:46:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:46:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:46:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:46:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:46:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:46:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:46:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:46:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:46:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273746159] [2022-07-21 15:46:14,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273746159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:14,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:14,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486821337] [2022-07-21 15:46:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:14,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:14,575 INFO L87 Difference]: Start difference. First operand 4183 states and 5897 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:20,497 INFO L93 Difference]: Finished difference Result 4183 states and 5897 transitions. [2022-07-21 15:46:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-07-21 15:46:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:20,511 INFO L225 Difference]: With dead ends: 4183 [2022-07-21 15:46:20,511 INFO L226 Difference]: Without dead ends: 4181 [2022-07-21 15:46:20,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:20,514 INFO L413 NwaCegarLoop]: 2611 mSDtfsCounter, 4403 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 4879 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:20,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 4879 Invalid, 5155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-21 15:46:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2022-07-21 15:46:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4181. [2022-07-21 15:46:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4181 states, 2929 states have (on average 1.2680095595766474) internal successors, (3714), 3011 states have internal predecessors, (3714), 1048 states have call successors, (1048), 188 states have call predecessors, (1048), 198 states have return successors, (1133), 1033 states have call predecessors, (1133), 1046 states have call successors, (1133) [2022-07-21 15:46:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 5895 transitions. [2022-07-21 15:46:20,789 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 5895 transitions. Word has length 174 [2022-07-21 15:46:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:20,789 INFO L495 AbstractCegarLoop]: Abstraction has 4181 states and 5895 transitions. [2022-07-21 15:46:20,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 5895 transitions. [2022-07-21 15:46:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-07-21 15:46:20,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:20,792 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:20,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:46:20,792 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 306935420, now seen corresponding path program 1 times [2022-07-21 15:46:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:20,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606661716] [2022-07-21 15:46:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:46:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:46:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:46:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 15:46:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:46:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-21 15:46:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-21 15:46:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:46:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-21 15:46:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:21,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606661716] [2022-07-21 15:46:21,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606661716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:46:21,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618650078] [2022-07-21 15:46:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:21,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:21,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:21,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:46:21,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 15:46:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:22,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 3558 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-21 15:46:22,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:46:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-21 15:46:22,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:46:22,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618650078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:22,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:46:22,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2022-07-21 15:46:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832924751] [2022-07-21 15:46:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:22,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:46:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:46:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:46:22,766 INFO L87 Difference]: Start difference. First operand 4181 states and 5895 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:23,222 INFO L93 Difference]: Finished difference Result 8364 states and 11871 transitions. [2022-07-21 15:46:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:46:23,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 250 [2022-07-21 15:46:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:23,237 INFO L225 Difference]: With dead ends: 8364 [2022-07-21 15:46:23,238 INFO L226 Difference]: Without dead ends: 4202 [2022-07-21 15:46:23,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:46:23,251 INFO L413 NwaCegarLoop]: 2935 mSDtfsCounter, 10 mSDsluCounter, 20525 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23460 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:23,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23460 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 15:46:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2022-07-21 15:46:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4196. [2022-07-21 15:46:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 2941 states have (on average 1.2665759945596735) internal successors, (3725), 3022 states have internal predecessors, (3725), 1049 states have call successors, (1049), 188 states have call predecessors, (1049), 200 states have return successors, (1138), 1037 states have call predecessors, (1138), 1047 states have call successors, (1138) [2022-07-21 15:46:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 5912 transitions. [2022-07-21 15:46:23,526 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 5912 transitions. Word has length 250 [2022-07-21 15:46:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 4196 states and 5912 transitions. [2022-07-21 15:46:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 5912 transitions. [2022-07-21 15:46:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-21 15:46:23,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:23,529 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:23,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 15:46:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 15:46:23,732 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -490191324, now seen corresponding path program 1 times [2022-07-21 15:46:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:23,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176498652] [2022-07-21 15:46:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:46:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:46:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:46:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:46:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:46:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:46:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:46:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:46:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:46:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:46:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:46:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:46:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:46:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:46:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:46:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:46:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:46:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 15:46:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:46:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:23,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176498652] [2022-07-21 15:46:23,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176498652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:23,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:23,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248888259] [2022-07-21 15:46:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:23,963 INFO L87 Difference]: Start difference. First operand 4196 states and 5912 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:46:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:29,864 INFO L93 Difference]: Finished difference Result 4196 states and 5912 transitions. [2022-07-21 15:46:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2022-07-21 15:46:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:29,876 INFO L225 Difference]: With dead ends: 4196 [2022-07-21 15:46:29,877 INFO L226 Difference]: Without dead ends: 3967 [2022-07-21 15:46:29,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:29,880 INFO L413 NwaCegarLoop]: 2610 mSDtfsCounter, 4394 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 2364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 4878 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2364 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:29,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 4878 Invalid, 5155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2364 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-21 15:46:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2022-07-21 15:46:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3967. [2022-07-21 15:46:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 2803 states have (on average 1.2761327149482697) internal successors, (3577), 2877 states have internal predecessors, (3577), 980 states have call successors, (980), 167 states have call predecessors, (980), 179 states have return successors, (1069), 972 states have call predecessors, (1069), 978 states have call successors, (1069) [2022-07-21 15:46:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 5626 transitions. [2022-07-21 15:46:30,144 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 5626 transitions. Word has length 180 [2022-07-21 15:46:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:30,144 INFO L495 AbstractCegarLoop]: Abstraction has 3967 states and 5626 transitions. [2022-07-21 15:46:30,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:46:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 5626 transitions. [2022-07-21 15:46:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-07-21 15:46:30,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:30,146 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:30,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 15:46:30,147 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-21 15:46:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2139354244, now seen corresponding path program 2 times [2022-07-21 15:46:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:30,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533526958] [2022-07-21 15:46:30,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:46:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:46:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:46:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 15:46:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:46:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 15:46:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-21 15:46:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:46:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-07-21 15:46:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533526958] [2022-07-21 15:46:30,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533526958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:46:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802344545] [2022-07-21 15:46:30,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 15:46:30,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:30,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:46:30,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 15:46:31,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 15:46:31,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 15:46:31,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 3558 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 15:46:31,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:46:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 104 proven. 3 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-21 15:46:31,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:46:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-07-21 15:46:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802344545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:46:32,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:46:32,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2022-07-21 15:46:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292362539] [2022-07-21 15:46:32,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:46:32,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 15:46:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 15:46:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-07-21 15:46:32,226 INFO L87 Difference]: Start difference. First operand 3967 states and 5626 transitions. Second operand has 23 states, 22 states have (on average 5.409090909090909) internal successors, (119), 15 states have internal predecessors, (119), 5 states have call successors, (49), 6 states have call predecessors, (49), 7 states have return successors, (41), 8 states have call predecessors, (41), 5 states have call successors, (41)