./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--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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--class--cdc-wdm.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 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:50:27,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:50:27,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:50:27,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:50:27,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:50:27,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:50:27,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:50:27,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:50:27,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:50:27,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:50:27,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:50:27,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:50:27,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:50:27,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:50:27,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:50:27,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:50:27,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:50:27,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:50:27,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:50:27,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:50:27,772 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:50:27,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:50:27,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:50:27,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:50:27,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:50:27,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:50:27,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:50:27,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:50:27,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:50:27,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:50:27,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:50:27,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:50:27,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:50:27,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:50:27,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:50:27,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:50:27,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:50:27,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:50:27,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:50:27,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:50:27,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:50:27,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:50:27,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:50:27,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:50:27,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:50:27,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:50:27,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:50:27,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:50:27,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:50:27,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:50:27,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:50:27,814 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:50:27,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:50:27,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:50:27,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:50:27,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:50:27,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:50:27,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:50:27,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:50:27,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:50:27,818 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:50:27,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:50:27,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:50:27,818 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 -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2022-07-14 04:50:28,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:50:28,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:50:28,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:50:28,123 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:50:28,124 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:50:28,125 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--class--cdc-wdm.ko.cil.i [2022-07-14 04:50:28,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c0ad6b0/c24fcbdb25114913bc9554b3d010d38c/FLAGa1eb7be6b [2022-07-14 04:50:28,769 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:50:28,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-14 04:50:28,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c0ad6b0/c24fcbdb25114913bc9554b3d010d38c/FLAGa1eb7be6b [2022-07-14 04:50:28,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c0ad6b0/c24fcbdb25114913bc9554b3d010d38c [2022-07-14 04:50:28,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:50:28,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:50:28,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:50:28,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:50:28,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:50:28,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:50:28" (1/1) ... [2022-07-14 04:50:28,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1a1fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:28, skipping insertion in model container [2022-07-14 04:50:28,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:50:28" (1/1) ... [2022-07-14 04:50:28,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:50:29,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:50:30,879 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--class--cdc-wdm.ko.cil.i[307309,307322] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[307454,307467] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[307600,307613] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[307765,307778] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[307923,307936] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308081,308094] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308239,308252] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308399,308412] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308558,308571] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308697,308710] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308839,308852] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[308988,309001] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[309127,309140] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[309282,309295] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[309442,309455] [2022-07-14 04:50:30,893 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--class--cdc-wdm.ko.cil.i[309593,309606] [2022-07-14 04:50:30,893 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--class--cdc-wdm.ko.cil.i[309744,309757] [2022-07-14 04:50:30,893 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--class--cdc-wdm.ko.cil.i[309896,309909] [2022-07-14 04:50:30,894 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--class--cdc-wdm.ko.cil.i[310045,310058] [2022-07-14 04:50:30,894 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--class--cdc-wdm.ko.cil.i[310193,310206] [2022-07-14 04:50:30,895 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--class--cdc-wdm.ko.cil.i[310350,310363] [2022-07-14 04:50:30,895 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--class--cdc-wdm.ko.cil.i[310499,310512] [2022-07-14 04:50:30,895 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--class--cdc-wdm.ko.cil.i[310655,310668] [2022-07-14 04:50:30,896 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--class--cdc-wdm.ko.cil.i[310808,310821] [2022-07-14 04:50:30,897 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--class--cdc-wdm.ko.cil.i[310954,310967] [2022-07-14 04:50:30,898 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--class--cdc-wdm.ko.cil.i[311097,311110] [2022-07-14 04:50:30,898 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--class--cdc-wdm.ko.cil.i[311249,311262] [2022-07-14 04:50:30,899 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--class--cdc-wdm.ko.cil.i[311395,311408] [2022-07-14 04:50:30,899 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--class--cdc-wdm.ko.cil.i[311540,311553] [2022-07-14 04:50:30,900 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--class--cdc-wdm.ko.cil.i[311694,311707] [2022-07-14 04:50:30,901 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--class--cdc-wdm.ko.cil.i[311845,311858] [2022-07-14 04:50:30,901 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--class--cdc-wdm.ko.cil.i[312000,312013] [2022-07-14 04:50:30,901 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--class--cdc-wdm.ko.cil.i[312152,312165] [2022-07-14 04:50:30,902 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--class--cdc-wdm.ko.cil.i[312307,312320] [2022-07-14 04:50:30,902 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--class--cdc-wdm.ko.cil.i[312471,312484] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[312627,312640] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[312791,312804] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[312933,312946] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313091,313104] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313258,313271] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313417,313430] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313576,313589] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313725,313738] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[313872,313885] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[314011,314024] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[314174,314187] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[314340,314353] [2022-07-14 04:50:30,907 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--class--cdc-wdm.ko.cil.i[314504,314517] [2022-07-14 04:50:30,908 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--class--cdc-wdm.ko.cil.i[314669,314682] [2022-07-14 04:50:30,908 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--class--cdc-wdm.ko.cil.i[314834,314847] [2022-07-14 04:50:30,908 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--class--cdc-wdm.ko.cil.i[315000,315013] [2022-07-14 04:50:30,908 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--class--cdc-wdm.ko.cil.i[315165,315178] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[315332,315345] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[315492,315505] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[315654,315667] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[315813,315826] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[315959,315972] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316102,316115] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316246,316259] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316389,316402] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316533,316546] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316674,316687] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316812,316825] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[316970,316983] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[317129,317142] [2022-07-14 04:50:30,914 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--class--cdc-wdm.ko.cil.i[317285,317298] [2022-07-14 04:50:30,914 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--class--cdc-wdm.ko.cil.i[317434,317447] [2022-07-14 04:50:30,914 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--class--cdc-wdm.ko.cil.i[317586,317599] [2022-07-14 04:50:30,914 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--class--cdc-wdm.ko.cil.i[317737,317750] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[317886,317899] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318038,318051] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318186,318199] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318339,318352] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318490,318503] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318640,318653] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[318787,318800] [2022-07-14 04:50:30,918 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--class--cdc-wdm.ko.cil.i[318938,318951] [2022-07-14 04:50:30,918 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--class--cdc-wdm.ko.cil.i[319089,319102] [2022-07-14 04:50:30,918 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--class--cdc-wdm.ko.cil.i[319237,319250] [2022-07-14 04:50:30,919 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--class--cdc-wdm.ko.cil.i[319403,319416] [2022-07-14 04:50:30,924 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--class--cdc-wdm.ko.cil.i[319572,319585] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[319739,319752] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[319907,319920] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[320057,320070] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[320204,320217] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[320365,320378] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[320535,320548] [2022-07-14 04:50:30,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--class--cdc-wdm.ko.cil.i[320697,320710] [2022-07-14 04:50:30,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:50:30,963 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:50:31,151 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--class--cdc-wdm.ko.cil.i[307309,307322] [2022-07-14 04:50:31,152 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--class--cdc-wdm.ko.cil.i[307454,307467] [2022-07-14 04:50:31,153 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--class--cdc-wdm.ko.cil.i[307600,307613] [2022-07-14 04:50:31,153 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--class--cdc-wdm.ko.cil.i[307765,307778] [2022-07-14 04:50:31,154 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--class--cdc-wdm.ko.cil.i[307923,307936] [2022-07-14 04:50:31,157 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--class--cdc-wdm.ko.cil.i[308081,308094] [2022-07-14 04:50:31,158 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--class--cdc-wdm.ko.cil.i[308239,308252] [2022-07-14 04:50:31,158 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--class--cdc-wdm.ko.cil.i[308399,308412] [2022-07-14 04:50:31,158 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--class--cdc-wdm.ko.cil.i[308558,308571] [2022-07-14 04:50:31,159 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--class--cdc-wdm.ko.cil.i[308697,308710] [2022-07-14 04:50:31,159 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--class--cdc-wdm.ko.cil.i[308839,308852] [2022-07-14 04:50:31,159 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--class--cdc-wdm.ko.cil.i[308988,309001] [2022-07-14 04:50:31,160 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--class--cdc-wdm.ko.cil.i[309127,309140] [2022-07-14 04:50:31,160 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--class--cdc-wdm.ko.cil.i[309282,309295] [2022-07-14 04:50:31,160 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--class--cdc-wdm.ko.cil.i[309442,309455] [2022-07-14 04:50:31,161 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--class--cdc-wdm.ko.cil.i[309593,309606] [2022-07-14 04:50:31,161 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--class--cdc-wdm.ko.cil.i[309744,309757] [2022-07-14 04:50:31,161 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--class--cdc-wdm.ko.cil.i[309896,309909] [2022-07-14 04:50:31,162 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--class--cdc-wdm.ko.cil.i[310045,310058] [2022-07-14 04:50:31,162 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--class--cdc-wdm.ko.cil.i[310193,310206] [2022-07-14 04:50:31,162 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--class--cdc-wdm.ko.cil.i[310350,310363] [2022-07-14 04:50:31,179 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--class--cdc-wdm.ko.cil.i[310499,310512] [2022-07-14 04:50:31,180 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--class--cdc-wdm.ko.cil.i[310655,310668] [2022-07-14 04:50:31,180 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--class--cdc-wdm.ko.cil.i[310808,310821] [2022-07-14 04:50:31,181 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--class--cdc-wdm.ko.cil.i[310954,310967] [2022-07-14 04:50:31,182 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--class--cdc-wdm.ko.cil.i[311097,311110] [2022-07-14 04:50:31,182 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--class--cdc-wdm.ko.cil.i[311249,311262] [2022-07-14 04:50:31,182 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--class--cdc-wdm.ko.cil.i[311395,311408] [2022-07-14 04:50:31,182 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--class--cdc-wdm.ko.cil.i[311540,311553] [2022-07-14 04:50:31,185 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--class--cdc-wdm.ko.cil.i[311694,311707] [2022-07-14 04:50:31,186 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--class--cdc-wdm.ko.cil.i[311845,311858] [2022-07-14 04:50:31,186 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--class--cdc-wdm.ko.cil.i[312000,312013] [2022-07-14 04:50:31,187 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--class--cdc-wdm.ko.cil.i[312152,312165] [2022-07-14 04:50:31,187 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--class--cdc-wdm.ko.cil.i[312307,312320] [2022-07-14 04:50:31,188 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--class--cdc-wdm.ko.cil.i[312471,312484] [2022-07-14 04:50:31,188 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--class--cdc-wdm.ko.cil.i[312627,312640] [2022-07-14 04:50:31,188 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--class--cdc-wdm.ko.cil.i[312791,312804] [2022-07-14 04:50:31,188 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--class--cdc-wdm.ko.cil.i[312933,312946] [2022-07-14 04:50:31,189 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--class--cdc-wdm.ko.cil.i[313091,313104] [2022-07-14 04:50:31,189 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--class--cdc-wdm.ko.cil.i[313258,313271] [2022-07-14 04:50:31,190 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--class--cdc-wdm.ko.cil.i[313417,313430] [2022-07-14 04:50:31,191 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--class--cdc-wdm.ko.cil.i[313576,313589] [2022-07-14 04:50:31,191 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--class--cdc-wdm.ko.cil.i[313725,313738] [2022-07-14 04:50:31,191 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--class--cdc-wdm.ko.cil.i[313872,313885] [2022-07-14 04:50:31,191 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--class--cdc-wdm.ko.cil.i[314011,314024] [2022-07-14 04:50:31,192 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--class--cdc-wdm.ko.cil.i[314174,314187] [2022-07-14 04:50:31,192 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--class--cdc-wdm.ko.cil.i[314340,314353] [2022-07-14 04:50:31,192 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--class--cdc-wdm.ko.cil.i[314504,314517] [2022-07-14 04:50:31,193 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--class--cdc-wdm.ko.cil.i[314669,314682] [2022-07-14 04:50:31,193 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--class--cdc-wdm.ko.cil.i[314834,314847] [2022-07-14 04:50:31,194 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--class--cdc-wdm.ko.cil.i[315000,315013] [2022-07-14 04:50:31,194 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--class--cdc-wdm.ko.cil.i[315165,315178] [2022-07-14 04:50:31,194 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--class--cdc-wdm.ko.cil.i[315332,315345] [2022-07-14 04:50:31,195 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--class--cdc-wdm.ko.cil.i[315492,315505] [2022-07-14 04:50:31,195 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--class--cdc-wdm.ko.cil.i[315654,315667] [2022-07-14 04:50:31,195 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--class--cdc-wdm.ko.cil.i[315813,315826] [2022-07-14 04:50:31,196 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--class--cdc-wdm.ko.cil.i[315959,315972] [2022-07-14 04:50:31,196 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--class--cdc-wdm.ko.cil.i[316102,316115] [2022-07-14 04:50:31,196 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--class--cdc-wdm.ko.cil.i[316246,316259] [2022-07-14 04:50:31,197 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--class--cdc-wdm.ko.cil.i[316389,316402] [2022-07-14 04:50:31,197 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--class--cdc-wdm.ko.cil.i[316533,316546] [2022-07-14 04:50:31,198 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--class--cdc-wdm.ko.cil.i[316674,316687] [2022-07-14 04:50:31,199 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--class--cdc-wdm.ko.cil.i[316812,316825] [2022-07-14 04:50:31,201 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--class--cdc-wdm.ko.cil.i[316970,316983] [2022-07-14 04:50:31,201 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--class--cdc-wdm.ko.cil.i[317129,317142] [2022-07-14 04:50:31,201 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--class--cdc-wdm.ko.cil.i[317285,317298] [2022-07-14 04:50:31,202 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--class--cdc-wdm.ko.cil.i[317434,317447] [2022-07-14 04:50:31,203 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--class--cdc-wdm.ko.cil.i[317586,317599] [2022-07-14 04:50:31,206 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--class--cdc-wdm.ko.cil.i[317737,317750] [2022-07-14 04:50:31,207 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--class--cdc-wdm.ko.cil.i[317886,317899] [2022-07-14 04:50:31,207 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--class--cdc-wdm.ko.cil.i[318038,318051] [2022-07-14 04:50:31,208 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--class--cdc-wdm.ko.cil.i[318186,318199] [2022-07-14 04:50:31,213 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--class--cdc-wdm.ko.cil.i[318339,318352] [2022-07-14 04:50:31,213 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--class--cdc-wdm.ko.cil.i[318490,318503] [2022-07-14 04:50:31,213 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--class--cdc-wdm.ko.cil.i[318640,318653] [2022-07-14 04:50:31,214 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--class--cdc-wdm.ko.cil.i[318787,318800] [2022-07-14 04:50:31,214 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--class--cdc-wdm.ko.cil.i[318938,318951] [2022-07-14 04:50:31,214 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--class--cdc-wdm.ko.cil.i[319089,319102] [2022-07-14 04:50:31,215 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--class--cdc-wdm.ko.cil.i[319237,319250] [2022-07-14 04:50:31,216 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--class--cdc-wdm.ko.cil.i[319403,319416] [2022-07-14 04:50:31,216 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--class--cdc-wdm.ko.cil.i[319572,319585] [2022-07-14 04:50:31,217 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--class--cdc-wdm.ko.cil.i[319739,319752] [2022-07-14 04:50:31,218 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--class--cdc-wdm.ko.cil.i[319907,319920] [2022-07-14 04:50:31,218 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--class--cdc-wdm.ko.cil.i[320057,320070] [2022-07-14 04:50:31,218 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--class--cdc-wdm.ko.cil.i[320204,320217] [2022-07-14 04:50:31,219 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--class--cdc-wdm.ko.cil.i[320365,320378] [2022-07-14 04:50:31,219 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--class--cdc-wdm.ko.cil.i[320535,320548] [2022-07-14 04:50:31,219 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--class--cdc-wdm.ko.cil.i[320697,320710] [2022-07-14 04:50:31,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:50:31,321 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:50:31,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31 WrapperNode [2022-07-14 04:50:31,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:50:31,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:50:31,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:50:31,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:50:31,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,480 INFO L137 Inliner]: procedures = 592, calls = 1771, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3189 [2022-07-14 04:50:31,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:50:31,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:50:31,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:50:31,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:50:31,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:50:31,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:50:31,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:50:31,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:50:31,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (1/1) ... [2022-07-14 04:50:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:50:31,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:50:31,689 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-14 04:50:31,760 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-14 04:50:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:50:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:50:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:50:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:50:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2022-07-14 04:50:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2022-07-14 04:50:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2022-07-14 04:50:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2022-07-14 04:50:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:50:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:50:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:50:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:50:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-14 04:50:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-14 04:50:31,804 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-14 04:50:31,804 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-14 04:50:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:50:31,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:50:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:50:31,805 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:50:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:50:31,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:50:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:50:31,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:50:31,805 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2022-07-14 04:50:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2022-07-14 04:50:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:50:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:50:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-14 04:50:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-07-14 04:50:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:50:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:50:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:50:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:50:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:50:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-14 04:50:31,807 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-14 04:50:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-14 04:50:31,807 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-14 04:50:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 04:50:31,807 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 04:50:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:50:31,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:50:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-14 04:50:31,808 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-14 04:50:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-14 04:50:31,808 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-14 04:50:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-14 04:50:31,808 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-14 04:50:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:50:31,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-14 04:50:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:50:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:50:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:50:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:50:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:50:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2022-07-14 04:50:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2022-07-14 04:50:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:50:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:50:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-14 04:50:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-14 04:50:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:50:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:50:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:50:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:50:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:50:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:50:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:50:31,811 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 04:50:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 04:50:31,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-14 04:50:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-07-14 04:50:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:50:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:50:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2022-07-14 04:50:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2022-07-14 04:50:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-14 04:50:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-14 04:50:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:50:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:50:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-14 04:50:31,816 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-14 04:50:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:50:31,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:50:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:50:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-14 04:50:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-07-14 04:50:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:50:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:50:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:50:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:50:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-14 04:50:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-14 04:50:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-07-14 04:50:31,817 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-07-14 04:50:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:50:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:50:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:50:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:50:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2022-07-14 04:50:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2022-07-14 04:50:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:50:31,818 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:50:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-14 04:50:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-14 04:50:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-14 04:50:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-14 04:50:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:50:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:50:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2022-07-14 04:50:31,819 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2022-07-14 04:50:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:50:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:50:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:50:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:50:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2022-07-14 04:50:31,820 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2022-07-14 04:50:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2022-07-14 04:50:31,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2022-07-14 04:50:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:50:31,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:50:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:50:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:50:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2022-07-14 04:50:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2022-07-14 04:50:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:50:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:50:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:50:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 04:50:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 04:50:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:50:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2022-07-14 04:50:31,823 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-14 04:50:31,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 04:50:31,823 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 04:50:31,823 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-14 04:50:31,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-14 04:50:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:50:31,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:50:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-14 04:50:31,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-07-14 04:50:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:50:31,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:50:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:50:31,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:50:31,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:50:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:50:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:50:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:50:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:50:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:50:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:50:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:50:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:50:31,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:50:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:50:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:50:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 04:50:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 04:50:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:50:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:50:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-14 04:50:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-07-14 04:50:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:50:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:50:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:50:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:50:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:50:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:50:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:50:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:50:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:50:31,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:50:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:50:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2022-07-14 04:50:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2022-07-14 04:50:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2022-07-14 04:50:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2022-07-14 04:50:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:50:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:50:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2022-07-14 04:50:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2022-07-14 04:50:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-14 04:50:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-07-14 04:50:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-14 04:50:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-14 04:50:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:50:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:50:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:50:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:50:31,829 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-14 04:50:31,829 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-14 04:50:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:50:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-14 04:50:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-07-14 04:50:31,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2022-07-14 04:50:31,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2022-07-14 04:50:32,295 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:50:32,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:50:32,428 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:50:35,166 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:50:35,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:50:35,192 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:50:35,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:50:35 BoogieIcfgContainer [2022-07-14 04:50:35,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:50:35,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:50:35,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:50:35,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:50:35,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:50:28" (1/3) ... [2022-07-14 04:50:35,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef9427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:50:35, skipping insertion in model container [2022-07-14 04:50:35,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:31" (2/3) ... [2022-07-14 04:50:35,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef9427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:50:35, skipping insertion in model container [2022-07-14 04:50:35,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:50:35" (3/3) ... [2022-07-14 04:50:35,206 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-07-14 04:50:35,221 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:50:35,221 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-14 04:50:35,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:50:35,342 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@18579ac5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18838642 [2022-07-14 04:50:35,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-14 04:50:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 1351 states, 842 states have (on average 1.2541567695961995) internal successors, (1056), 894 states have internal predecessors, (1056), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) [2022-07-14 04:50:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 04:50:35,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:35,358 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:35,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash 975260104, now seen corresponding path program 1 times [2022-07-14 04:50:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:35,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850535304] [2022-07-14 04:50:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:35,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850535304] [2022-07-14 04:50:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850535304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814521962] [2022-07-14 04:50:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:35,894 INFO L87 Difference]: Start difference. First operand has 1351 states, 842 states have (on average 1.2541567695961995) internal successors, (1056), 894 states have internal predecessors, (1056), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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-14 04:50:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:38,594 INFO L93 Difference]: Finished difference Result 2639 states and 3702 transitions. [2022-07-14 04:50:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:38,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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 71 [2022-07-14 04:50:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:38,656 INFO L225 Difference]: With dead ends: 2639 [2022-07-14 04:50:38,656 INFO L226 Difference]: Without dead ends: 1333 [2022-07-14 04:50:38,680 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-14 04:50:38,683 INFO L413 NwaCegarLoop]: 1643 mSDtfsCounter, 2296 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:38,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 3351 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1298 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:50:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-14 04:50:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2022-07-14 04:50:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 832 states have (on average 1.2067307692307692) internal successors, (1004), 879 states have internal predecessors, (1004), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1760 transitions. [2022-07-14 04:50:38,823 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1760 transitions. Word has length 71 [2022-07-14 04:50:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:38,824 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1760 transitions. [2022-07-14 04:50:38,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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-14 04:50:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1760 transitions. [2022-07-14 04:50:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 04:50:38,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:38,827 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:50:38,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1189993464, now seen corresponding path program 1 times [2022-07-14 04:50:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205716850] [2022-07-14 04:50:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205716850] [2022-07-14 04:50:39,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205716850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:39,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:39,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650747108] [2022-07-14 04:50:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:39,007 INFO L87 Difference]: Start difference. First operand 1333 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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-14 04:50:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:41,639 INFO L93 Difference]: Finished difference Result 1333 states and 1760 transitions. [2022-07-14 04:50:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:41,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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 77 [2022-07-14 04:50:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:41,646 INFO L225 Difference]: With dead ends: 1333 [2022-07-14 04:50:41,646 INFO L226 Difference]: Without dead ends: 1331 [2022-07-14 04:50:41,647 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-14 04:50:41,648 INFO L413 NwaCegarLoop]: 1623 mSDtfsCounter, 2262 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2496 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:41,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2496 Valid, 3311 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 04:50:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-14 04:50:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2022-07-14 04:50:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 831 states have (on average 1.2057761732851986) internal successors, (1002), 877 states have internal predecessors, (1002), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1758 transitions. [2022-07-14 04:50:41,692 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1758 transitions. Word has length 77 [2022-07-14 04:50:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:41,692 INFO L495 AbstractCegarLoop]: Abstraction has 1331 states and 1758 transitions. [2022-07-14 04:50:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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-14 04:50:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1758 transitions. [2022-07-14 04:50:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 04:50:41,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:41,697 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:41,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:50:41,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1626433505, now seen corresponding path program 1 times [2022-07-14 04:50:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262549314] [2022-07-14 04:50:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:41,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262549314] [2022-07-14 04:50:41,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262549314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:41,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:41,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885143781] [2022-07-14 04:50:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:41,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:41,935 INFO L87 Difference]: Start difference. First operand 1331 states and 1758 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-14 04:50:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:44,724 INFO L93 Difference]: Finished difference Result 1331 states and 1758 transitions. [2022-07-14 04:50:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 83 [2022-07-14 04:50:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:44,730 INFO L225 Difference]: With dead ends: 1331 [2022-07-14 04:50:44,732 INFO L226 Difference]: Without dead ends: 1329 [2022-07-14 04:50:44,732 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-14 04:50:44,733 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 2256 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:44,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3309 Invalid, 2945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 04:50:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-14 04:50:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2022-07-14 04:50:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 830 states have (on average 1.2048192771084338) internal successors, (1000), 875 states have internal predecessors, (1000), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1756 transitions. [2022-07-14 04:50:44,790 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1756 transitions. Word has length 83 [2022-07-14 04:50:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:44,790 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1756 transitions. [2022-07-14 04:50:44,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-14 04:50:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1756 transitions. [2022-07-14 04:50:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-14 04:50:44,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:44,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:44,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:50:44,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash -586799079, now seen corresponding path program 1 times [2022-07-14 04:50:44,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:44,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372520738] [2022-07-14 04:50:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:50:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372520738] [2022-07-14 04:50:45,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372520738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:45,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:45,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803731848] [2022-07-14 04:50:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:45,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:45,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:45,009 INFO L87 Difference]: Start difference. First operand 1329 states and 1756 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-14 04:50:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:47,201 INFO L93 Difference]: Finished difference Result 1329 states and 1756 transitions. [2022-07-14 04:50:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 89 [2022-07-14 04:50:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:47,207 INFO L225 Difference]: With dead ends: 1329 [2022-07-14 04:50:47,208 INFO L226 Difference]: Without dead ends: 1327 [2022-07-14 04:50:47,209 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-14 04:50:47,211 INFO L413 NwaCegarLoop]: 1619 mSDtfsCounter, 2250 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2482 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:47,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2482 Valid, 3307 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 04:50:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-07-14 04:50:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2022-07-14 04:50:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 829 states have (on average 1.203860072376357) internal successors, (998), 873 states have internal predecessors, (998), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1754 transitions. [2022-07-14 04:50:47,252 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1754 transitions. Word has length 89 [2022-07-14 04:50:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:47,253 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1754 transitions. [2022-07-14 04:50:47,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-14 04:50:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1754 transitions. [2022-07-14 04:50:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 04:50:47,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:47,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:47,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:50:47,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1454441485, now seen corresponding path program 1 times [2022-07-14 04:50:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:47,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549607304] [2022-07-14 04:50:47,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:50:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:50:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:47,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549607304] [2022-07-14 04:50:47,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549607304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:47,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:47,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51983950] [2022-07-14 04:50:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:47,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:47,468 INFO L87 Difference]: Start difference. First operand 1327 states and 1754 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-14 04:50:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:50,041 INFO L93 Difference]: Finished difference Result 1327 states and 1754 transitions. [2022-07-14 04:50:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 95 [2022-07-14 04:50:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:50,049 INFO L225 Difference]: With dead ends: 1327 [2022-07-14 04:50:50,050 INFO L226 Difference]: Without dead ends: 1325 [2022-07-14 04:50:50,050 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-14 04:50:50,051 INFO L413 NwaCegarLoop]: 1617 mSDtfsCounter, 2244 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2475 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:50,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2475 Valid, 3305 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:50:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-14 04:50:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2022-07-14 04:50:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 828 states have (on average 1.2028985507246377) internal successors, (996), 871 states have internal predecessors, (996), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1752 transitions. [2022-07-14 04:50:50,090 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1752 transitions. Word has length 95 [2022-07-14 04:50:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:50,091 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1752 transitions. [2022-07-14 04:50:50,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-14 04:50:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1752 transitions. [2022-07-14 04:50:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 04:50:50,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:50,109 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:50,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:50:50,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1693669281, now seen corresponding path program 1 times [2022-07-14 04:50:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:50,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094980138] [2022-07-14 04:50:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:50:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:50:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:50:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094980138] [2022-07-14 04:50:50,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094980138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:50,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:50,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91975977] [2022-07-14 04:50:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:50,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:50,407 INFO L87 Difference]: Start difference. First operand 1325 states and 1752 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-14 04:50:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:52,791 INFO L93 Difference]: Finished difference Result 1325 states and 1752 transitions. [2022-07-14 04:50:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 101 [2022-07-14 04:50:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:52,796 INFO L225 Difference]: With dead ends: 1325 [2022-07-14 04:50:52,806 INFO L226 Difference]: Without dead ends: 1323 [2022-07-14 04:50:52,807 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-14 04:50:52,808 INFO L413 NwaCegarLoop]: 1615 mSDtfsCounter, 2238 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:52,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 3303 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 04:50:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-07-14 04:50:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1323. [2022-07-14 04:50:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 827 states have (on average 1.2019347037484884) internal successors, (994), 869 states have internal predecessors, (994), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1750 transitions. [2022-07-14 04:50:52,880 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1750 transitions. Word has length 101 [2022-07-14 04:50:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:52,880 INFO L495 AbstractCegarLoop]: Abstraction has 1323 states and 1750 transitions. [2022-07-14 04:50:52,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-14 04:50:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1750 transitions. [2022-07-14 04:50:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 04:50:52,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:52,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:52,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:50:52,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:52,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 203341486, now seen corresponding path program 1 times [2022-07-14 04:50:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:52,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831536604] [2022-07-14 04:50:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:50:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:50:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:50:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:50:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:53,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831536604] [2022-07-14 04:50:53,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831536604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:53,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:53,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133234822] [2022-07-14 04:50:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:53,040 INFO L87 Difference]: Start difference. First operand 1323 states and 1750 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:50:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:55,692 INFO L93 Difference]: Finished difference Result 1323 states and 1750 transitions. [2022-07-14 04:50:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2022-07-14 04:50:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:55,698 INFO L225 Difference]: With dead ends: 1323 [2022-07-14 04:50:55,698 INFO L226 Difference]: Without dead ends: 1321 [2022-07-14 04:50:55,699 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-14 04:50:55,699 INFO L413 NwaCegarLoop]: 1613 mSDtfsCounter, 2232 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:55,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 3301 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 04:50:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-07-14 04:50:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2022-07-14 04:50:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 826 states have (on average 1.2009685230024214) internal successors, (992), 867 states have internal predecessors, (992), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1748 transitions. [2022-07-14 04:50:55,739 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1748 transitions. Word has length 107 [2022-07-14 04:50:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:55,739 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1748 transitions. [2022-07-14 04:50:55,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-14 04:50:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1748 transitions. [2022-07-14 04:50:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-14 04:50:55,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:55,741 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:50:55,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:50:55,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1038477238, now seen corresponding path program 1 times [2022-07-14 04:50:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:55,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674738357] [2022-07-14 04:50:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:50:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:50:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:50:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:50:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:50:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:50:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:50:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:50:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:50:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:50:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:50:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:50:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:56,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674738357] [2022-07-14 04:50:56,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674738357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:56,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650621981] [2022-07-14 04:50:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:56,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:56,053 INFO L87 Difference]: Start difference. First operand 1321 states and 1748 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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-14 04:50:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:50:57,912 INFO L93 Difference]: Finished difference Result 1321 states and 1748 transitions. [2022-07-14 04:50:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:50:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2022-07-14 04:50:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:50:57,918 INFO L225 Difference]: With dead ends: 1321 [2022-07-14 04:50:57,919 INFO L226 Difference]: Without dead ends: 1319 [2022-07-14 04:50:57,920 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-14 04:50:57,921 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 2230 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:50:57,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2458 Valid, 3299 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 04:50:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-14 04:50:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2022-07-14 04:50:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 825 states have (on average 1.2) internal successors, (990), 865 states have internal predecessors, (990), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:50:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1746 transitions. [2022-07-14 04:50:58,004 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1746 transitions. Word has length 113 [2022-07-14 04:50:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:50:58,004 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1746 transitions. [2022-07-14 04:50:58,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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-14 04:50:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1746 transitions. [2022-07-14 04:50:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-14 04:50:58,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:58,006 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-14 04:50:58,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:50:58,006 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:50:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash 470652601, now seen corresponding path program 1 times [2022-07-14 04:50:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899360461] [2022-07-14 04:50:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:50:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:50:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:50:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:50:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:50:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:50:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:50:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:50:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:50:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:50:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:50:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:50:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:50:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:50:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:50:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:50:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:50:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:50:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:50:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-14 04:50:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899360461] [2022-07-14 04:50:58,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899360461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:58,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:58,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425204084] [2022-07-14 04:50:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:58,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:58,290 INFO L87 Difference]: Start difference. First operand 1319 states and 1746 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:51:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:01,124 INFO L93 Difference]: Finished difference Result 2452 states and 3227 transitions. [2022-07-14 04:51:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:51:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2022-07-14 04:51:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:01,132 INFO L225 Difference]: With dead ends: 2452 [2022-07-14 04:51:01,133 INFO L226 Difference]: Without dead ends: 1329 [2022-07-14 04:51:01,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:51:01,138 INFO L413 NwaCegarLoop]: 1355 mSDtfsCounter, 2602 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 1764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1764 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:01,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 2766 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1764 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:51:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-14 04:51:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1315. [2022-07-14 04:51:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 822 states have (on average 1.1982968369829683) internal successors, (985), 861 states have internal predecessors, (985), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:51:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1741 transitions. [2022-07-14 04:51:01,232 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1741 transitions. Word has length 155 [2022-07-14 04:51:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:01,233 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 1741 transitions. [2022-07-14 04:51:01,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:51:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1741 transitions. [2022-07-14 04:51:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-14 04:51:01,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:01,236 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:01,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:51:01,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1544345977, now seen corresponding path program 1 times [2022-07-14 04:51:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:01,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988370535] [2022-07-14 04:51:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:01,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988370535] [2022-07-14 04:51:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988370535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:01,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:01,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875580711] [2022-07-14 04:51:01,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:01,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:01,426 INFO L87 Difference]: Start difference. First operand 1315 states and 1741 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-14 04:51:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:04,218 INFO L93 Difference]: Finished difference Result 1315 states and 1741 transitions. [2022-07-14 04:51:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:04,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 115 [2022-07-14 04:51:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:04,223 INFO L225 Difference]: With dead ends: 1315 [2022-07-14 04:51:04,224 INFO L226 Difference]: Without dead ends: 1313 [2022-07-14 04:51:04,224 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-14 04:51:04,225 INFO L413 NwaCegarLoop]: 1604 mSDtfsCounter, 2213 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2441 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:04,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2441 Valid, 3278 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:51:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2022-07-14 04:51:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2022-07-14 04:51:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 821 states have (on average 1.197320341047503) internal successors, (983), 859 states have internal predecessors, (983), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-07-14 04:51:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1739 transitions. [2022-07-14 04:51:04,334 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1739 transitions. Word has length 115 [2022-07-14 04:51:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:04,336 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 1739 transitions. [2022-07-14 04:51:04,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-14 04:51:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1739 transitions. [2022-07-14 04:51:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-14 04:51:04,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:04,338 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-14 04:51:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:51:04,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash 800072008, now seen corresponding path program 1 times [2022-07-14 04:51:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001213752] [2022-07-14 04:51:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:51:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:51:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:51:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:51:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:51:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:51:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-14 04:51:04,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001213752] [2022-07-14 04:51:04,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001213752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:51:04,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781542847] [2022-07-14 04:51:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:04,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:51:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:51:04,635 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-14 04:51:04,687 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-14 04:51:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:51:05,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:51:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-14 04:51:05,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:51:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781542847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:05,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:51:05,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:51:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984149334] [2022-07-14 04:51:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:05,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:51:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:51:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:05,314 INFO L87 Difference]: Start difference. First operand 1313 states and 1739 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:51:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:05,393 INFO L93 Difference]: Finished difference Result 2479 states and 3255 transitions. [2022-07-14 04:51:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:51:05,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2022-07-14 04:51:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:05,401 INFO L225 Difference]: With dead ends: 2479 [2022-07-14 04:51:05,401 INFO L226 Difference]: Without dead ends: 1365 [2022-07-14 04:51:05,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:05,406 INFO L413 NwaCegarLoop]: 1798 mSDtfsCounter, 1717 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1865 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:51:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-07-14 04:51:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1362. [2022-07-14 04:51:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 850 states have (on average 1.1917647058823528) internal successors, (1013), 891 states have internal predecessors, (1013), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-07-14 04:51:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1799 transitions. [2022-07-14 04:51:05,464 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1799 transitions. Word has length 161 [2022-07-14 04:51:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:05,464 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1799 transitions. [2022-07-14 04:51:05,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:51:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1799 transitions. [2022-07-14 04:51:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 04:51:05,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:05,466 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:05,504 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-14 04:51:05,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 04:51:05,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2087551557, now seen corresponding path program 1 times [2022-07-14 04:51:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:05,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588605568] [2022-07-14 04:51:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588605568] [2022-07-14 04:51:05,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588605568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:05,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:05,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680751038] [2022-07-14 04:51:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:05,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:05,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:05,885 INFO L87 Difference]: Start difference. First operand 1362 states and 1799 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-14 04:51:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:08,205 INFO L93 Difference]: Finished difference Result 1362 states and 1799 transitions. [2022-07-14 04:51:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 121 [2022-07-14 04:51:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:08,214 INFO L225 Difference]: With dead ends: 1362 [2022-07-14 04:51:08,214 INFO L226 Difference]: Without dead ends: 1360 [2022-07-14 04:51:08,214 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-14 04:51:08,215 INFO L413 NwaCegarLoop]: 1597 mSDtfsCounter, 2204 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:08,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 3257 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 04:51:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-07-14 04:51:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2022-07-14 04:51:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 849 states have (on average 1.1908127208480566) internal successors, (1011), 889 states have internal predecessors, (1011), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-07-14 04:51:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1797 transitions. [2022-07-14 04:51:08,300 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1797 transitions. Word has length 121 [2022-07-14 04:51:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:08,301 INFO L495 AbstractCegarLoop]: Abstraction has 1360 states and 1797 transitions. [2022-07-14 04:51:08,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-14 04:51:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1797 transitions. [2022-07-14 04:51:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 04:51:08,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:08,303 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:51:08,303 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1837786247, now seen corresponding path program 1 times [2022-07-14 04:51:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:08,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029994939] [2022-07-14 04:51:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:51:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:51:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:51:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:51:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:51:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-14 04:51:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:08,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029994939] [2022-07-14 04:51:08,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029994939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:08,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:08,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:51:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597588385] [2022-07-14 04:51:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:51:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:51:08,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:51:08,635 INFO L87 Difference]: Start difference. First operand 1360 states and 1797 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:51:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:13,053 INFO L93 Difference]: Finished difference Result 1593 states and 2040 transitions. [2022-07-14 04:51:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:51:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2022-07-14 04:51:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:13,060 INFO L225 Difference]: With dead ends: 1593 [2022-07-14 04:51:13,060 INFO L226 Difference]: Without dead ends: 1591 [2022-07-14 04:51:13,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:51:13,062 INFO L413 NwaCegarLoop]: 1663 mSDtfsCounter, 2718 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 1884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 4571 SdHoareTripleChecker+Invalid, 5624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1884 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:13,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 4571 Invalid, 5624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1884 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 04:51:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-07-14 04:51:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1563. [2022-07-14 04:51:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 981 states have (on average 1.17940876656473) internal successors, (1157), 1021 states have internal predecessors, (1157), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2007 transitions. [2022-07-14 04:51:13,137 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2007 transitions. Word has length 153 [2022-07-14 04:51:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:13,138 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2007 transitions. [2022-07-14 04:51:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:51:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2007 transitions. [2022-07-14 04:51:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 04:51:13,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:13,140 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-14 04:51:13,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:51:13,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2107684610, now seen corresponding path program 1 times [2022-07-14 04:51:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994154216] [2022-07-14 04:51:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:51:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:51:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:51:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:51:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:51:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:51:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-14 04:51:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:13,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994154216] [2022-07-14 04:51:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994154216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:13,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:13,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:51:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388768303] [2022-07-14 04:51:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:51:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:51:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:51:13,443 INFO L87 Difference]: Start difference. First operand 1563 states and 2007 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:51:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:18,049 INFO L93 Difference]: Finished difference Result 3034 states and 3916 transitions. [2022-07-14 04:51:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:51:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2022-07-14 04:51:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:18,070 INFO L225 Difference]: With dead ends: 3034 [2022-07-14 04:51:18,074 INFO L226 Difference]: Without dead ends: 1577 [2022-07-14 04:51:18,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:51:18,089 INFO L413 NwaCegarLoop]: 1588 mSDtfsCounter, 2561 mSDsluCounter, 3309 mSDsCounter, 0 mSdLazyCounter, 4432 mSolverCounterSat, 1770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2794 SdHoareTripleChecker+Valid, 4897 SdHoareTripleChecker+Invalid, 6202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1770 IncrementalHoareTripleChecker+Valid, 4432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:18,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2794 Valid, 4897 Invalid, 6202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1770 Valid, 4432 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 04:51:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-07-14 04:51:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1563. [2022-07-14 04:51:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 981 states have (on average 1.1773700305810397) internal successors, (1155), 1021 states have internal predecessors, (1155), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2005 transitions. [2022-07-14 04:51:18,221 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2005 transitions. Word has length 166 [2022-07-14 04:51:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:18,223 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 2005 transitions. [2022-07-14 04:51:18,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:51:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2005 transitions. [2022-07-14 04:51:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 04:51:18,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:18,225 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-14 04:51:18,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:51:18,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2107625028, now seen corresponding path program 1 times [2022-07-14 04:51:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:18,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607134875] [2022-07-14 04:51:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:51:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:51:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:51:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:51:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:51:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-14 04:51:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-14 04:51:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607134875] [2022-07-14 04:51:18,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607134875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:18,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:18,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:51:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321829679] [2022-07-14 04:51:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:51:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:51:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:51:18,489 INFO L87 Difference]: Start difference. First operand 1563 states and 2005 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-14 04:51:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:22,520 INFO L93 Difference]: Finished difference Result 1577 states and 2029 transitions. [2022-07-14 04:51:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:51:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2022-07-14 04:51:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:22,526 INFO L225 Difference]: With dead ends: 1577 [2022-07-14 04:51:22,527 INFO L226 Difference]: Without dead ends: 1575 [2022-07-14 04:51:22,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-14 04:51:22,530 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 1364 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 1484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1484 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:22,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4424 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1484 Valid, 3166 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-14 04:51:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-14 04:51:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1561. [2022-07-14 04:51:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 980 states have (on average 1.1755102040816328) internal successors, (1152), 1019 states have internal predecessors, (1152), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2002 transitions. [2022-07-14 04:51:22,591 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2002 transitions. Word has length 166 [2022-07-14 04:51:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:22,591 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 2002 transitions. [2022-07-14 04:51:22,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-14 04:51:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2002 transitions. [2022-07-14 04:51:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-14 04:51:22,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:22,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:22,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:51:22,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1495386975, now seen corresponding path program 1 times [2022-07-14 04:51:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283622799] [2022-07-14 04:51:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:22,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:22,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283622799] [2022-07-14 04:51:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283622799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:22,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:22,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437922408] [2022-07-14 04:51:22,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:22,783 INFO L87 Difference]: Start difference. First operand 1561 states and 2002 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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-14 04:51:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:25,021 INFO L93 Difference]: Finished difference Result 1561 states and 2002 transitions. [2022-07-14 04:51:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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 127 [2022-07-14 04:51:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:25,030 INFO L225 Difference]: With dead ends: 1561 [2022-07-14 04:51:25,030 INFO L226 Difference]: Without dead ends: 1559 [2022-07-14 04:51:25,031 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-14 04:51:25,032 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 2189 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2415 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:25,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2415 Valid, 3252 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 04:51:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2022-07-14 04:51:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2022-07-14 04:51:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 979 states have (on average 1.1746680286006128) internal successors, (1150), 1017 states have internal predecessors, (1150), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2000 transitions. [2022-07-14 04:51:25,101 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2000 transitions. Word has length 127 [2022-07-14 04:51:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:25,101 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2000 transitions. [2022-07-14 04:51:25,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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-14 04:51:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2000 transitions. [2022-07-14 04:51:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-14 04:51:25,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:25,103 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-14 04:51:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:51:25,103 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1863471288, now seen corresponding path program 1 times [2022-07-14 04:51:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514458552] [2022-07-14 04:51:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:51:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:51:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:51:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:51:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:51:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:51:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-14 04:51:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:25,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514458552] [2022-07-14 04:51:25,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514458552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:25,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:25,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:25,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187899871] [2022-07-14 04:51:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:25,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:25,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:25,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:25,344 INFO L87 Difference]: Start difference. First operand 1559 states and 2000 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:51:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:27,466 INFO L93 Difference]: Finished difference Result 3020 states and 3895 transitions. [2022-07-14 04:51:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2022-07-14 04:51:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:27,478 INFO L225 Difference]: With dead ends: 3020 [2022-07-14 04:51:27,478 INFO L226 Difference]: Without dead ends: 1567 [2022-07-14 04:51:27,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:27,500 INFO L413 NwaCegarLoop]: 1580 mSDtfsCounter, 2522 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 1762 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1762 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:27,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 2979 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1762 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 04:51:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-14 04:51:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1553. [2022-07-14 04:51:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 974 states have (on average 1.1714579055441479) internal successors, (1141), 1011 states have internal predecessors, (1141), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2022-07-14 04:51:27,633 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 173 [2022-07-14 04:51:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:27,633 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2022-07-14 04:51:27,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:51:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2022-07-14 04:51:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-14 04:51:27,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:27,648 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:51:27,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1932909630, now seen corresponding path program 1 times [2022-07-14 04:51:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571375178] [2022-07-14 04:51:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:51:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:51:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:51:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:51:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:51:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-14 04:51:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:27,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571375178] [2022-07-14 04:51:27,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571375178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:27,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:27,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:51:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191406352] [2022-07-14 04:51:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:27,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:51:27,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:51:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:51:27,895 INFO L87 Difference]: Start difference. First operand 1553 states and 1991 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:51:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:31,955 INFO L93 Difference]: Finished difference Result 1595 states and 2039 transitions. [2022-07-14 04:51:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:51:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2022-07-14 04:51:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:31,974 INFO L225 Difference]: With dead ends: 1595 [2022-07-14 04:51:31,974 INFO L226 Difference]: Without dead ends: 1593 [2022-07-14 04:51:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:51:31,976 INFO L413 NwaCegarLoop]: 1584 mSDtfsCounter, 2998 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 2273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3218 SdHoareTripleChecker+Valid, 4900 SdHoareTripleChecker+Invalid, 5767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2273 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:31,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3218 Valid, 4900 Invalid, 5767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2273 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-14 04:51:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-14 04:51:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1577. [2022-07-14 04:51:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 992 states have (on average 1.1703629032258065) internal successors, (1161), 1029 states have internal predecessors, (1161), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2011 transitions. [2022-07-14 04:51:32,043 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2011 transitions. Word has length 164 [2022-07-14 04:51:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:32,043 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2011 transitions. [2022-07-14 04:51:32,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:51:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2011 transitions. [2022-07-14 04:51:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-14 04:51:32,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:32,045 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:51:32,046 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1219574549, now seen corresponding path program 1 times [2022-07-14 04:51:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683487648] [2022-07-14 04:51:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683487648] [2022-07-14 04:51:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683487648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:32,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:32,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587689286] [2022-07-14 04:51:32,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:32,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:32,211 INFO L87 Difference]: Start difference. First operand 1577 states and 2011 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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-14 04:51:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:34,774 INFO L93 Difference]: Finished difference Result 1577 states and 2011 transitions. [2022-07-14 04:51:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:34,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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 133 [2022-07-14 04:51:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:34,780 INFO L225 Difference]: With dead ends: 1577 [2022-07-14 04:51:34,780 INFO L226 Difference]: Without dead ends: 1575 [2022-07-14 04:51:34,781 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-14 04:51:34,781 INFO L413 NwaCegarLoop]: 1585 mSDtfsCounter, 2168 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:34,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3245 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:51:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-07-14 04:51:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2022-07-14 04:51:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 991 states have (on average 1.1695257315842584) internal successors, (1159), 1027 states have internal predecessors, (1159), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2009 transitions. [2022-07-14 04:51:34,848 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2009 transitions. Word has length 133 [2022-07-14 04:51:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:34,849 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2009 transitions. [2022-07-14 04:51:34,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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-14 04:51:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2009 transitions. [2022-07-14 04:51:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-14 04:51:34,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:34,850 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:34,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:51:34,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash -462029759, now seen corresponding path program 1 times [2022-07-14 04:51:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:34,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649448630] [2022-07-14 04:51:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:35,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649448630] [2022-07-14 04:51:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649448630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:35,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:35,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729774972] [2022-07-14 04:51:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:35,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:35,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:35,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:35,028 INFO L87 Difference]: Start difference. First operand 1575 states and 2009 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-14 04:51:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:37,636 INFO L93 Difference]: Finished difference Result 1575 states and 2009 transitions. [2022-07-14 04:51:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:37,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 139 [2022-07-14 04:51:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:37,641 INFO L225 Difference]: With dead ends: 1575 [2022-07-14 04:51:37,641 INFO L226 Difference]: Without dead ends: 1573 [2022-07-14 04:51:37,644 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-14 04:51:37,644 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 2162 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:37,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 3243 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:51:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-07-14 04:51:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2022-07-14 04:51:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 990 states have (on average 1.1686868686868688) internal successors, (1157), 1025 states have internal predecessors, (1157), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2007 transitions. [2022-07-14 04:51:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2007 transitions. Word has length 139 [2022-07-14 04:51:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:37,713 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2007 transitions. [2022-07-14 04:51:37,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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-14 04:51:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2007 transitions. [2022-07-14 04:51:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-14 04:51:37,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:37,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:37,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:51:37,716 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1035613449, now seen corresponding path program 1 times [2022-07-14 04:51:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204409837] [2022-07-14 04:51:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204409837] [2022-07-14 04:51:37,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204409837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:37,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:37,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174115562] [2022-07-14 04:51:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:37,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:37,898 INFO L87 Difference]: Start difference. First operand 1573 states and 2007 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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-14 04:51:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:40,066 INFO L93 Difference]: Finished difference Result 1573 states and 2007 transitions. [2022-07-14 04:51:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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 145 [2022-07-14 04:51:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:40,071 INFO L225 Difference]: With dead ends: 1573 [2022-07-14 04:51:40,072 INFO L226 Difference]: Without dead ends: 1571 [2022-07-14 04:51:40,072 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-14 04:51:40,073 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 2156 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:40,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 3241 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 04:51:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2022-07-14 04:51:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2022-07-14 04:51:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 989 states have (on average 1.167846309403438) internal successors, (1155), 1023 states have internal predecessors, (1155), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2005 transitions. [2022-07-14 04:51:40,136 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2005 transitions. Word has length 145 [2022-07-14 04:51:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:40,136 INFO L495 AbstractCegarLoop]: Abstraction has 1571 states and 2005 transitions. [2022-07-14 04:51:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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-14 04:51:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2005 transitions. [2022-07-14 04:51:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-14 04:51:40,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:40,138 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:40,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:51:40,138 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1583947181, now seen corresponding path program 1 times [2022-07-14 04:51:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:40,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500410937] [2022-07-14 04:51:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:40,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500410937] [2022-07-14 04:51:40,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500410937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:40,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:40,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361250015] [2022-07-14 04:51:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:40,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:40,391 INFO L87 Difference]: Start difference. First operand 1571 states and 2005 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-14 04:51:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:42,362 INFO L93 Difference]: Finished difference Result 1571 states and 2005 transitions. [2022-07-14 04:51:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:42,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 151 [2022-07-14 04:51:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:42,368 INFO L225 Difference]: With dead ends: 1571 [2022-07-14 04:51:42,368 INFO L226 Difference]: Without dead ends: 1569 [2022-07-14 04:51:42,369 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-14 04:51:42,370 INFO L413 NwaCegarLoop]: 1579 mSDtfsCounter, 2150 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:42,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 3239 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 04:51:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2022-07-14 04:51:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2022-07-14 04:51:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 988 states have (on average 1.167004048582996) internal successors, (1153), 1021 states have internal predecessors, (1153), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2003 transitions. [2022-07-14 04:51:42,433 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2003 transitions. Word has length 151 [2022-07-14 04:51:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:42,434 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2003 transitions. [2022-07-14 04:51:42,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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-14 04:51:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2003 transitions. [2022-07-14 04:51:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-14 04:51:42,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:42,436 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:42,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:51:42,436 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -836954508, now seen corresponding path program 1 times [2022-07-14 04:51:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:42,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194523591] [2022-07-14 04:51:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:51:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:51:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:51:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:51:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:51:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:51:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:51:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-07-14 04:51:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:42,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194523591] [2022-07-14 04:51:42,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194523591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:42,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:42,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:51:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397647924] [2022-07-14 04:51:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:42,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:51:42,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:51:42,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:42,628 INFO L87 Difference]: Start difference. First operand 1569 states and 2003 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:51:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:48,145 INFO L93 Difference]: Finished difference Result 1589 states and 2033 transitions. [2022-07-14 04:51:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 04:51:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2022-07-14 04:51:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:48,151 INFO L225 Difference]: With dead ends: 1589 [2022-07-14 04:51:48,151 INFO L226 Difference]: Without dead ends: 1587 [2022-07-14 04:51:48,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-07-14 04:51:48,152 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2266 mSDsluCounter, 4492 mSDsCounter, 0 mSdLazyCounter, 4746 mSolverCounterSat, 2510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 7256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2510 IncrementalHoareTripleChecker+Valid, 4746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:48,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6067 Invalid, 7256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2510 Valid, 4746 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-14 04:51:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2022-07-14 04:51:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1569. [2022-07-14 04:51:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 988 states have (on average 1.1649797570850202) internal successors, (1151), 1021 states have internal predecessors, (1151), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2001 transitions. [2022-07-14 04:51:48,230 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2001 transitions. Word has length 187 [2022-07-14 04:51:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:48,230 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 2001 transitions. [2022-07-14 04:51:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:51:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2001 transitions. [2022-07-14 04:51:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 04:51:48,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:48,232 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:51:48,233 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2023750506, now seen corresponding path program 1 times [2022-07-14 04:51:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753424348] [2022-07-14 04:51:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753424348] [2022-07-14 04:51:48,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753424348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:48,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:48,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852745798] [2022-07-14 04:51:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:48,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:48,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:48,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:48,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:48,428 INFO L87 Difference]: Start difference. First operand 1569 states and 2001 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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-14 04:51:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:50,998 INFO L93 Difference]: Finished difference Result 1569 states and 2001 transitions. [2022-07-14 04:51:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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 157 [2022-07-14 04:51:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:51,009 INFO L225 Difference]: With dead ends: 1569 [2022-07-14 04:51:51,009 INFO L226 Difference]: Without dead ends: 1567 [2022-07-14 04:51:51,010 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-14 04:51:51,010 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 2144 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:51,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 3237 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:51:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-07-14 04:51:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2022-07-14 04:51:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 987 states have (on average 1.1641337386018238) internal successors, (1149), 1019 states have internal predecessors, (1149), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1999 transitions. [2022-07-14 04:51:51,095 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1999 transitions. Word has length 157 [2022-07-14 04:51:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:51,095 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 1999 transitions. [2022-07-14 04:51:51,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 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-14 04:51:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1999 transitions. [2022-07-14 04:51:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-14 04:51:51,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:51,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:51,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:51:51,098 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash 893411218, now seen corresponding path program 1 times [2022-07-14 04:51:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:51,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063058356] [2022-07-14 04:51:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:51:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:51,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063058356] [2022-07-14 04:51:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063058356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:51,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:51,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126539420] [2022-07-14 04:51:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:51,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:51,368 INFO L87 Difference]: Start difference. First operand 1567 states and 1999 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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-14 04:51:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:53,623 INFO L93 Difference]: Finished difference Result 1567 states and 1999 transitions. [2022-07-14 04:51:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:53,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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 163 [2022-07-14 04:51:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:53,629 INFO L225 Difference]: With dead ends: 1567 [2022-07-14 04:51:53,629 INFO L226 Difference]: Without dead ends: 1565 [2022-07-14 04:51:53,630 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-14 04:51:53,630 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 2138 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2358 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:53,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2358 Valid, 3235 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 04:51:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-07-14 04:51:53,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-07-14 04:51:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 986 states have (on average 1.1632860040567952) internal successors, (1147), 1017 states have internal predecessors, (1147), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1997 transitions. [2022-07-14 04:51:53,735 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1997 transitions. Word has length 163 [2022-07-14 04:51:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:53,736 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1997 transitions. [2022-07-14 04:51:53,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 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-14 04:51:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1997 transitions. [2022-07-14 04:51:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 04:51:53,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:53,740 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:51:53,740 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -992837032, now seen corresponding path program 1 times [2022-07-14 04:51:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587380033] [2022-07-14 04:51:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:51:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:51:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587380033] [2022-07-14 04:51:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587380033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:53,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:53,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109719841] [2022-07-14 04:51:53,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:53,954 INFO L87 Difference]: Start difference. First operand 1565 states and 1997 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 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-14 04:51:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:55,966 INFO L93 Difference]: Finished difference Result 1565 states and 1997 transitions. [2022-07-14 04:51:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 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 169 [2022-07-14 04:51:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:55,972 INFO L225 Difference]: With dead ends: 1565 [2022-07-14 04:51:55,972 INFO L226 Difference]: Without dead ends: 1563 [2022-07-14 04:51:55,972 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-14 04:51:55,973 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 2132 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:55,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 3233 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 04:51:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-14 04:51:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-14 04:51:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 985 states have (on average 1.1624365482233503) internal successors, (1145), 1015 states have internal predecessors, (1145), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1995 transitions. [2022-07-14 04:51:56,068 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1995 transitions. Word has length 169 [2022-07-14 04:51:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:56,068 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1995 transitions. [2022-07-14 04:51:56,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 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-14 04:51:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1995 transitions. [2022-07-14 04:51:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 04:51:56,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:56,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:56,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 04:51:56,071 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1416811539, now seen corresponding path program 1 times [2022-07-14 04:51:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:56,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421739127] [2022-07-14 04:51:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:51:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:51:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:51:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:51:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:51:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:51:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:51:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:51:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:51:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:51:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:51:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:51:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:51:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:51:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:51:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:51:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421739127] [2022-07-14 04:51:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421739127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:56,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73593525] [2022-07-14 04:51:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:56,225 INFO L87 Difference]: Start difference. First operand 1563 states and 1995 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 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-14 04:51:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:58,705 INFO L93 Difference]: Finished difference Result 1563 states and 1995 transitions. [2022-07-14 04:51:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 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 175 [2022-07-14 04:51:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:58,710 INFO L225 Difference]: With dead ends: 1563 [2022-07-14 04:51:58,710 INFO L226 Difference]: Without dead ends: 1561 [2022-07-14 04:51:58,711 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-14 04:51:58,712 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 2126 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:58,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 3231 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 04:51:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-14 04:51:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2022-07-14 04:51:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 984 states have (on average 1.1615853658536586) internal successors, (1143), 1013 states have internal predecessors, (1143), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:51:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1993 transitions. [2022-07-14 04:51:58,788 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1993 transitions. Word has length 175 [2022-07-14 04:51:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:58,789 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1993 transitions. [2022-07-14 04:51:58,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 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-14 04:51:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1993 transitions. [2022-07-14 04:51:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-14 04:51:58,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:58,791 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:51:58,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:51:58,791 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:51:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 731543701, now seen corresponding path program 1 times [2022-07-14 04:51:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582389304] [2022-07-14 04:51:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:51:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:51:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:51:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:51:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:51:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:51:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:51:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:51:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:51:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:51:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:51:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:51:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:51:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:51:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:51:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:51:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:51:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-14 04:51:59,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582389304] [2022-07-14 04:51:59,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582389304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:59,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:59,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:51:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573743945] [2022-07-14 04:51:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:59,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:51:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:59,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:51:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:59,218 INFO L87 Difference]: Start difference. First operand 1561 states and 1993 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-14 04:52:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:05,985 INFO L93 Difference]: Finished difference Result 1595 states and 2032 transitions. [2022-07-14 04:52:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 04:52:05,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 212 [2022-07-14 04:52:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:05,990 INFO L225 Difference]: With dead ends: 1595 [2022-07-14 04:52:05,990 INFO L226 Difference]: Without dead ends: 1593 [2022-07-14 04:52:05,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-07-14 04:52:05,991 INFO L413 NwaCegarLoop]: 1629 mSDtfsCounter, 2796 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 4972 mSolverCounterSat, 2823 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 6055 SdHoareTripleChecker+Invalid, 7795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2823 IncrementalHoareTripleChecker+Valid, 4972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:05,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 6055 Invalid, 7795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2823 Valid, 4972 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-14 04:52:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-07-14 04:52:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1565. [2022-07-14 04:52:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 987 states have (on average 1.1610942249240122) internal successors, (1146), 1016 states have internal predecessors, (1146), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:52:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 1996 transitions. [2022-07-14 04:52:06,071 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 1996 transitions. Word has length 212 [2022-07-14 04:52:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:06,072 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 1996 transitions. [2022-07-14 04:52:06,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-14 04:52:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1996 transitions. [2022-07-14 04:52:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-14 04:52:06,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:06,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:06,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 04:52:06,074 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 578281643, now seen corresponding path program 1 times [2022-07-14 04:52:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:06,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305412191] [2022-07-14 04:52:06,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:52:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:52:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:52:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:52:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:52:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:52:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:52:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:52:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:52:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:52:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:52:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:52:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:52:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:52:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:52:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:52:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:52:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:52:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:52:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:52:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:52:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305412191] [2022-07-14 04:52:06,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305412191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:06,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:06,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115528238] [2022-07-14 04:52:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:06,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:06,245 INFO L87 Difference]: Start difference. First operand 1565 states and 1996 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-14 04:52:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:08,948 INFO L93 Difference]: Finished difference Result 1565 states and 1996 transitions. [2022-07-14 04:52:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 181 [2022-07-14 04:52:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:08,953 INFO L225 Difference]: With dead ends: 1565 [2022-07-14 04:52:08,953 INFO L226 Difference]: Without dead ends: 1563 [2022-07-14 04:52:08,954 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-14 04:52:08,954 INFO L413 NwaCegarLoop]: 1569 mSDtfsCounter, 2120 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:08,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 3229 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 04:52:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-07-14 04:52:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-07-14 04:52:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 986 states have (on average 1.1602434077079107) internal successors, (1144), 1014 states have internal predecessors, (1144), 426 states have call successors, (426), 146 states have call predecessors, (426), 145 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-07-14 04:52:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1994 transitions. [2022-07-14 04:52:09,043 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1994 transitions. Word has length 181 [2022-07-14 04:52:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:09,043 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1994 transitions. [2022-07-14 04:52:09,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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-14 04:52:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1994 transitions. [2022-07-14 04:52:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-14 04:52:09,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:09,047 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:09,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 04:52:09,047 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1220089259, now seen corresponding path program 1 times [2022-07-14 04:52:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195297983] [2022-07-14 04:52:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:52:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:52:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:52:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-14 04:52:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-14 04:52:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-14 04:52:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 04:52:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 04:52:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:52:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:52:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 04:52:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 04:52:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:52:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:52:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:52:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:52:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:52:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:52:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 04:52:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 04:52:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:52:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 04:52:09,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:09,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195297983] [2022-07-14 04:52:09,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195297983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:09,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:09,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443671040] [2022-07-14 04:52:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:09,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:09,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:09,254 INFO L87 Difference]: Start difference. First operand 1563 states and 1994 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-14 04:52:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:13,958 INFO L93 Difference]: Finished difference Result 2967 states and 3785 transitions. [2022-07-14 04:52:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:52:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-14 04:52:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:13,969 INFO L225 Difference]: With dead ends: 2967 [2022-07-14 04:52:13,969 INFO L226 Difference]: Without dead ends: 2812 [2022-07-14 04:52:13,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:52:13,973 INFO L413 NwaCegarLoop]: 1972 mSDtfsCounter, 2775 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 2107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2988 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 5702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2107 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:13,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2988 Valid, 4354 Invalid, 5702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2107 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 04:52:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-07-14 04:52:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2798. [2022-07-14 04:52:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 1767 states have (on average 1.1641199773627617) internal successors, (2057), 1810 states have internal predecessors, (2057), 763 states have call successors, (763), 262 states have call predecessors, (763), 262 states have return successors, (775), 757 states have call predecessors, (775), 761 states have call successors, (775) [2022-07-14 04:52:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3595 transitions. [2022-07-14 04:52:14,145 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3595 transitions. Word has length 187 [2022-07-14 04:52:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:14,146 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3595 transitions. [2022-07-14 04:52:14,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-14 04:52:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3595 transitions. [2022-07-14 04:52:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-14 04:52:14,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:14,148 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 04:52:14,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 04:52:14,149 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -732030745, now seen corresponding path program 1 times [2022-07-14 04:52:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:14,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683121198] [2022-07-14 04:52:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:52:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:52:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:52:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:52:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:52:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:52:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:52:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:52:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:52:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:52:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:52:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:52:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-14 04:52:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-14 04:52:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-14 04:52:14,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:14,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683121198] [2022-07-14 04:52:14,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683121198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:14,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:14,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:52:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733883474] [2022-07-14 04:52:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:14,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:52:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:52:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:14,480 INFO L87 Difference]: Start difference. First operand 2798 states and 3595 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-14 04:52:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:21,513 INFO L93 Difference]: Finished difference Result 5279 states and 6917 transitions. [2022-07-14 04:52:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:52:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 223 [2022-07-14 04:52:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:21,523 INFO L225 Difference]: With dead ends: 5279 [2022-07-14 04:52:21,524 INFO L226 Difference]: Without dead ends: 3536 [2022-07-14 04:52:21,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:52:21,528 INFO L413 NwaCegarLoop]: 1704 mSDtfsCounter, 3060 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 5458 mSolverCounterSat, 3604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 9062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3604 IncrementalHoareTripleChecker+Valid, 5458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 6192 Invalid, 9062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3604 Valid, 5458 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-14 04:52:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2022-07-14 04:52:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2806. [2022-07-14 04:52:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 1773 states have (on average 1.1635645798082346) internal successors, (2063), 1816 states have internal predecessors, (2063), 765 states have call successors, (765), 262 states have call predecessors, (765), 262 states have return successors, (777), 759 states have call predecessors, (777), 763 states have call successors, (777) [2022-07-14 04:52:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3605 transitions. [2022-07-14 04:52:21,720 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3605 transitions. Word has length 223 [2022-07-14 04:52:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:21,721 INFO L495 AbstractCegarLoop]: Abstraction has 2806 states and 3605 transitions. [2022-07-14 04:52:21,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-14 04:52:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3605 transitions. [2022-07-14 04:52:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-14 04:52:21,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:21,723 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 04:52:21,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 04:52:21,723 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 93185672, now seen corresponding path program 1 times [2022-07-14 04:52:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326283341] [2022-07-14 04:52:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:52:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:52:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:52:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:52:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:52:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:52:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:52:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:52:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:52:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:52:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:52:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 04:52:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:52:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:52:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-14 04:52:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326283341] [2022-07-14 04:52:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326283341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:21,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:21,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:52:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015140822] [2022-07-14 04:52:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:21,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:52:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:52:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:21,995 INFO L87 Difference]: Start difference. First operand 2806 states and 3605 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:52:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:28,842 INFO L93 Difference]: Finished difference Result 4330 states and 5557 transitions. [2022-07-14 04:52:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 04:52:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2022-07-14 04:52:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:28,854 INFO L225 Difference]: With dead ends: 4330 [2022-07-14 04:52:28,854 INFO L226 Difference]: Without dead ends: 4328 [2022-07-14 04:52:28,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2022-07-14 04:52:28,856 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 4282 mSDsluCounter, 4605 mSDsCounter, 0 mSdLazyCounter, 5348 mSolverCounterSat, 3849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 6388 SdHoareTripleChecker+Invalid, 9197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 5348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:28,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 6388 Invalid, 9197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3849 Valid, 5348 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 04:52:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2022-07-14 04:52:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4272. [2022-07-14 04:52:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 2709 states have (on average 1.1742340346991509) internal successors, (3181), 2780 states have internal predecessors, (3181), 1141 states have call successors, (1141), 422 states have call predecessors, (1141), 416 states have return successors, (1154), 1119 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-14 04:52:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5476 transitions. [2022-07-14 04:52:29,171 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5476 transitions. Word has length 225 [2022-07-14 04:52:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:29,172 INFO L495 AbstractCegarLoop]: Abstraction has 4272 states and 5476 transitions. [2022-07-14 04:52:29,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:52:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5476 transitions. [2022-07-14 04:52:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-14 04:52:29,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:29,174 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:29,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 04:52:29,175 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1014321496, now seen corresponding path program 1 times [2022-07-14 04:52:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:29,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619989259] [2022-07-14 04:52:29,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:29,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:52:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 04:52:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 04:52:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:52:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:52:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 04:52:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:52:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:52:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:52:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 04:52:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:52:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 04:52:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-14 04:52:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:52:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:52:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-07-14 04:52:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:29,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619989259] [2022-07-14 04:52:29,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619989259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:29,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:29,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:52:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655922901] [2022-07-14 04:52:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:29,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:52:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:52:29,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:52:29,536 INFO L87 Difference]: Start difference. First operand 4272 states and 5476 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-07-14 04:52:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:37,163 INFO L93 Difference]: Finished difference Result 4352 states and 5579 transitions. [2022-07-14 04:52:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 04:52:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) Word has length 238 [2022-07-14 04:52:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:37,174 INFO L225 Difference]: With dead ends: 4352 [2022-07-14 04:52:37,174 INFO L226 Difference]: Without dead ends: 4350 [2022-07-14 04:52:37,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-14 04:52:37,175 INFO L413 NwaCegarLoop]: 2141 mSDtfsCounter, 3405 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 6948 mSolverCounterSat, 3708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 9036 SdHoareTripleChecker+Invalid, 10656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3708 IncrementalHoareTripleChecker+Valid, 6948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:37,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 9036 Invalid, 10656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3708 Valid, 6948 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:52:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2022-07-14 04:52:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4286. [2022-07-14 04:52:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 2719 states have (on average 1.17285766826039) internal successors, (3189), 2790 states have internal predecessors, (3189), 1141 states have call successors, (1141), 424 states have call predecessors, (1141), 420 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-14 04:52:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5484 transitions. [2022-07-14 04:52:37,440 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5484 transitions. Word has length 238 [2022-07-14 04:52:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:37,441 INFO L495 AbstractCegarLoop]: Abstraction has 4286 states and 5484 transitions. [2022-07-14 04:52:37,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-07-14 04:52:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5484 transitions. [2022-07-14 04:52:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-14 04:52:37,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:37,443 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:37,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 04:52:37,443 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1482365617, now seen corresponding path program 1 times [2022-07-14 04:52:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998161798] [2022-07-14 04:52:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:52:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:52:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:52:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:52:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:52:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:52:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:52:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:52:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:52:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:52:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:52:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:52:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:52:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 04:52:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:52:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2022-07-14 04:52:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998161798] [2022-07-14 04:52:37,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998161798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:37,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:37,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:52:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143145821] [2022-07-14 04:52:37,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:37,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:52:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:52:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:37,731 INFO L87 Difference]: Start difference. First operand 4286 states and 5484 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:52:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:43,587 INFO L93 Difference]: Finished difference Result 4410 states and 5608 transitions. [2022-07-14 04:52:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:52:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 257 [2022-07-14 04:52:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:43,600 INFO L225 Difference]: With dead ends: 4410 [2022-07-14 04:52:43,600 INFO L226 Difference]: Without dead ends: 4408 [2022-07-14 04:52:43,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:52:43,603 INFO L413 NwaCegarLoop]: 1564 mSDtfsCounter, 2802 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 2268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 6304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2268 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:43,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 5415 Invalid, 6304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2268 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:52:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-07-14 04:52:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4364. [2022-07-14 04:52:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4364 states, 2774 states have (on average 1.1665465032444124) internal successors, (3236), 2844 states have internal predecessors, (3236), 1141 states have call successors, (1141), 448 states have call predecessors, (1141), 444 states have return successors, (1154), 1121 states have call predecessors, (1154), 1139 states have call successors, (1154) [2022-07-14 04:52:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4364 states to 4364 states and 5531 transitions. [2022-07-14 04:52:43,913 INFO L78 Accepts]: Start accepts. Automaton has 4364 states and 5531 transitions. Word has length 257 [2022-07-14 04:52:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:43,913 INFO L495 AbstractCegarLoop]: Abstraction has 4364 states and 5531 transitions. [2022-07-14 04:52:43,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-14 04:52:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4364 states and 5531 transitions. [2022-07-14 04:52:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-14 04:52:43,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:43,916 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:43,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 04:52:43,916 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -96816453, now seen corresponding path program 1 times [2022-07-14 04:52:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:43,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935527417] [2022-07-14 04:52:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:52:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:52:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:52:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:52:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:52:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:52:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:52:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:52:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:52:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:52:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:52:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:52:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:52:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:52:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:52:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:52:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:52:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-07-14 04:52:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:44,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935527417] [2022-07-14 04:52:44,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935527417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:44,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:44,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:52:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467104572] [2022-07-14 04:52:44,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:44,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:52:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:52:44,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:44,253 INFO L87 Difference]: Start difference. First operand 4364 states and 5531 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 04:52:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:50,801 INFO L93 Difference]: Finished difference Result 7337 states and 9258 transitions. [2022-07-14 04:52:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 04:52:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 283 [2022-07-14 04:52:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:50,819 INFO L225 Difference]: With dead ends: 7337 [2022-07-14 04:52:50,820 INFO L226 Difference]: Without dead ends: 7335 [2022-07-14 04:52:50,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-07-14 04:52:50,823 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 4590 mSDsluCounter, 4536 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 3977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 6453 SdHoareTripleChecker+Invalid, 9472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3977 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:50,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 6453 Invalid, 9472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3977 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-14 04:52:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-14 04:52:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7220. [2022-07-14 04:52:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 4644 states have (on average 1.173557278208441) internal successors, (5450), 4775 states have internal predecessors, (5450), 1820 states have call successors, (1820), 759 states have call predecessors, (1820), 751 states have return successors, (1837), 1777 states have call predecessors, (1837), 1818 states have call successors, (1837) [2022-07-14 04:52:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9107 transitions. [2022-07-14 04:52:51,342 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9107 transitions. Word has length 283 [2022-07-14 04:52:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:51,343 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9107 transitions. [2022-07-14 04:52:51,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 04:52:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9107 transitions. [2022-07-14 04:52:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-14 04:52:51,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:51,346 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:52:51,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-14 04:52:51,346 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:52:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 42848457, now seen corresponding path program 1 times [2022-07-14 04:52:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541795057] [2022-07-14 04:52:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:52:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:52:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:52:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:52:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:52:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:52:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:52:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:52:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:52:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 04:52:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:52:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:52:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-14 04:52:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-14 04:52:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-14 04:52:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-14 04:52:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 04:52:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-14 04:52:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 04:52:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:52:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-14 04:52:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-14 04:52:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:52:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 04:52:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-14 04:52:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-07-14 04:52:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:51,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541795057] [2022-07-14 04:52:51,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541795057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:51,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:51,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 04:52:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176620603] [2022-07-14 04:52:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:51,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 04:52:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 04:52:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:52:51,748 INFO L87 Difference]: Start difference. First operand 7220 states and 9107 transitions. Second operand has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-14 04:53:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:02,058 INFO L93 Difference]: Finished difference Result 14425 states and 18195 transitions. [2022-07-14 04:53:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 04:53:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) Word has length 301 [2022-07-14 04:53:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:02,155 INFO L225 Difference]: With dead ends: 14425 [2022-07-14 04:53:02,155 INFO L226 Difference]: Without dead ends: 7335 [2022-07-14 04:53:02,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-07-14 04:53:02,166 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 2391 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 9525 mSolverCounterSat, 2933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 9286 SdHoareTripleChecker+Invalid, 12458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2933 IncrementalHoareTripleChecker+Valid, 9525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:02,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 9286 Invalid, 12458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2933 Valid, 9525 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-14 04:53:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2022-07-14 04:53:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7234. [2022-07-14 04:53:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7234 states, 4654 states have (on average 1.1731843575418994) internal successors, (5460), 4785 states have internal predecessors, (5460), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2022-07-14 04:53:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 9124 transitions. [2022-07-14 04:53:02,612 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 9124 transitions. Word has length 301 [2022-07-14 04:53:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 7234 states and 9124 transitions. [2022-07-14 04:53:02,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-14 04:53:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 9124 transitions. [2022-07-14 04:53:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-14 04:53:02,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:02,615 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:53:02,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-14 04:53:02,616 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:53:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -692844118, now seen corresponding path program 1 times [2022-07-14 04:53:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413054817] [2022-07-14 04:53:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:53:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 04:53:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:53:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 04:53:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:53:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:53:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:53:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:53:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-14 04:53:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:53:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 04:53:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-14 04:53:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 04:53:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-14 04:53:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-14 04:53:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 04:53:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 04:53:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:53:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 04:53:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:53:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 04:53:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-14 04:53:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-14 04:53:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 04:53:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-14 04:53:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2022-07-14 04:53:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413054817] [2022-07-14 04:53:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413054817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:02,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:02,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:53:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076253899] [2022-07-14 04:53:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:02,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:53:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:02,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:53:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:53:02,879 INFO L87 Difference]: Start difference. First operand 7234 states and 9124 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-14 04:53:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:09,647 INFO L93 Difference]: Finished difference Result 7327 states and 9253 transitions. [2022-07-14 04:53:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 04:53:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 311 [2022-07-14 04:53:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:09,675 INFO L225 Difference]: With dead ends: 7327 [2022-07-14 04:53:09,675 INFO L226 Difference]: Without dead ends: 7325 [2022-07-14 04:53:09,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-07-14 04:53:09,681 INFO L413 NwaCegarLoop]: 1555 mSDtfsCounter, 2600 mSDsluCounter, 4415 mSDsCounter, 0 mSdLazyCounter, 4710 mSolverCounterSat, 2952 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 5970 SdHoareTripleChecker+Invalid, 7662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2952 IncrementalHoareTripleChecker+Valid, 4710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:09,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5970 Invalid, 7662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2952 Valid, 4710 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-14 04:53:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7325 states. [2022-07-14 04:53:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7325 to 7232. [2022-07-14 04:53:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 4653 states have (on average 1.1702127659574468) internal successors, (5445), 4783 states have internal predecessors, (5445), 1822 states have call successors, (1822), 759 states have call predecessors, (1822), 753 states have return successors, (1842), 1780 states have call predecessors, (1842), 1820 states have call successors, (1842) [2022-07-14 04:53:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 9109 transitions. [2022-07-14 04:53:10,348 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 9109 transitions. Word has length 311 [2022-07-14 04:53:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:10,349 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 9109 transitions. [2022-07-14 04:53:10,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-14 04:53:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 9109 transitions. [2022-07-14 04:53:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-14 04:53:10,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:10,353 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:53:10,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-14 04:53:10,353 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:53:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -765994228, now seen corresponding path program 1 times [2022-07-14 04:53:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:10,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601881205] [2022-07-14 04:53:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:10,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 04:53:10,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381164114] [2022-07-14 04:53:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:53:10,415 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-14 04:53:10,416 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-14 04:53:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:11,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 2996 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 04:53:11,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:53:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-14 04:53:11,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:53:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601881205] [2022-07-14 04:53:11,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 04:53:11,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381164114] [2022-07-14 04:53:11,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381164114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:11,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:11,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997071791] [2022-07-14 04:53:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:11,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:11,287 INFO L87 Difference]: Start difference. First operand 7232 states and 9109 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-14 04:53:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:12,323 INFO L93 Difference]: Finished difference Result 17089 states and 22315 transitions. [2022-07-14 04:53:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 322 [2022-07-14 04:53:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:12,347 INFO L225 Difference]: With dead ends: 17089 [2022-07-14 04:53:12,347 INFO L226 Difference]: Without dead ends: 9902 [2022-07-14 04:53:12,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:53:12,364 INFO L413 NwaCegarLoop]: 1827 mSDtfsCounter, 696 mSDsluCounter, 6940 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 8767 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:12,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 8767 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:53:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9902 states. [2022-07-14 04:53:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9902 to 7200. [2022-07-14 04:53:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.1701898188093183) internal successors, (5425), 4763 states have internal predecessors, (5425), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-14 04:53:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9065 transitions. [2022-07-14 04:53:12,979 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9065 transitions. Word has length 322 [2022-07-14 04:53:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:12,980 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9065 transitions. [2022-07-14 04:53:12,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2022-07-14 04:53:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9065 transitions. [2022-07-14 04:53:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-14 04:53:12,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:12,984 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:53:13,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 04:53:13,192 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,SelfDestructingSolverStorable37 [2022-07-14 04:53:13,193 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:53:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1409689970, now seen corresponding path program 1 times [2022-07-14 04:53:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005759253] [2022-07-14 04:53:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:13,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 04:53:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406952005] [2022-07-14 04:53:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:13,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:53:13,276 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-14 04:53:13,288 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-14 04:53:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:14,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 2994 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 04:53:14,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:53:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 251 proven. 3 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-07-14 04:53:14,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:53:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-07-14 04:53:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:14,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005759253] [2022-07-14 04:53:14,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 04:53:14,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406952005] [2022-07-14 04:53:14,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406952005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:53:14,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:53:14,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-14 04:53:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890544249] [2022-07-14 04:53:14,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:53:14,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 04:53:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 04:53:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:53:14,941 INFO L87 Difference]: Start difference. First operand 7200 states and 9065 transitions. Second operand has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-14 04:53:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:16,153 INFO L93 Difference]: Finished difference Result 17065 states and 22289 transitions. [2022-07-14 04:53:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:53:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 322 [2022-07-14 04:53:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:16,179 INFO L225 Difference]: With dead ends: 17065 [2022-07-14 04:53:16,180 INFO L226 Difference]: Without dead ends: 9907 [2022-07-14 04:53:16,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:53:16,197 INFO L413 NwaCegarLoop]: 2325 mSDtfsCounter, 464 mSDsluCounter, 24027 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 26352 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:16,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 26352 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:53:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-14 04:53:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-14 04:53:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.1699741156169112) internal successors, (5424), 4762 states have internal predecessors, (5424), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-14 04:53:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9064 transitions. [2022-07-14 04:53:16,736 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9064 transitions. Word has length 322 [2022-07-14 04:53:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:16,736 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9064 transitions. [2022-07-14 04:53:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-14 04:53:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9064 transitions. [2022-07-14 04:53:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-14 04:53:16,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:16,740 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:53:16,766 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-14 04:53:16,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:16,959 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:53:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1225714191, now seen corresponding path program 1 times [2022-07-14 04:53:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:16,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143157021] [2022-07-14 04:53:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:17,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 04:53:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590158082] [2022-07-14 04:53:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:17,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:17,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:53:17,019 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-14 04:53:17,020 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-14 04:53:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:18,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 3012 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 04:53:18,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:53:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 337 proven. 3 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-14 04:53:18,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:53:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-07-14 04:53:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:19,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143157021] [2022-07-14 04:53:19,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 04:53:19,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590158082] [2022-07-14 04:53:19,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590158082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:53:19,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 04:53:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-07-14 04:53:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506625294] [2022-07-14 04:53:19,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 04:53:19,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 04:53:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 04:53:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-14 04:53:19,045 INFO L87 Difference]: Start difference. First operand 7200 states and 9064 transitions. Second operand has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-14 04:53:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:20,567 INFO L93 Difference]: Finished difference Result 17060 states and 22280 transitions. [2022-07-14 04:53:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:53:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 326 [2022-07-14 04:53:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:20,590 INFO L225 Difference]: With dead ends: 17060 [2022-07-14 04:53:20,591 INFO L226 Difference]: Without dead ends: 9907 [2022-07-14 04:53:20,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:53:20,605 INFO L413 NwaCegarLoop]: 2324 mSDtfsCounter, 917 mSDsluCounter, 17804 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 20128 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:20,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 20128 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 04:53:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9907 states. [2022-07-14 04:53:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9907 to 7200. [2022-07-14 04:53:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 4636 states have (on average 1.169758412424504) internal successors, (5423), 4761 states have internal predecessors, (5423), 1810 states have call successors, (1810), 756 states have call predecessors, (1810), 750 states have return successors, (1830), 1769 states have call predecessors, (1830), 1808 states have call successors, (1830) [2022-07-14 04:53:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 9063 transitions. [2022-07-14 04:53:21,191 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 9063 transitions. Word has length 326 [2022-07-14 04:53:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:21,191 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 9063 transitions. [2022-07-14 04:53:21,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-07-14 04:53:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 9063 transitions. [2022-07-14 04:53:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-07-14 04:53:21,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:21,195 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:53:21,225 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-14 04:53:21,415 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,SelfDestructingSolverStorable39 [2022-07-14 04:53:21,416 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-14 04:53:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1356949358, now seen corresponding path program 1 times [2022-07-14 04:53:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:21,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311733294] [2022-07-14 04:53:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:21,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-14 04:53:21,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332032094] [2022-07-14 04:53:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:53:21,512 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-14 04:53:21,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process