./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--gadget--udc--net2272.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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--gadget--udc--net2272.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 d9035b4ec3c8be0c8a62b9c4cf3880a262fca73149d78c2d88c8226ff5942d9e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:25:45,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:25:45,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:25:45,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:25:45,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:25:45,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:25:45,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:25:45,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:25:45,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:25:45,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:25:45,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:25:45,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:25:45,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:25:45,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:25:45,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:25:45,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:25:45,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:25:45,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:25:45,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:25:45,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:25:45,768 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:25:45,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:25:45,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:25:45,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:25:45,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:25:45,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:25:45,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:25:45,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:25:45,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:25:45,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:25:45,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:25:45,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:25:45,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:25:45,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:25:45,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:25:45,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:25:45,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:25:45,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:25:45,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:25:45,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:25:45,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:25:45,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:25:45,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:25:45,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:25:45,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:25:45,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:25:45,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:25:45,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:25:45,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:25:45,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:25:45,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:25:45,823 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:25:45,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:25:45,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:25:45,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:25:45,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:25:45,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:25:45,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:25:45,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:25:45,826 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:25:45,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:25:45,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:25:45,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:25:45,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:25:45,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:25:45,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:25:45,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:25:45,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:25:45,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:25:45,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:25:45,830 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:25:45,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:25:45,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:25:45,830 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 -> d9035b4ec3c8be0c8a62b9c4cf3880a262fca73149d78c2d88c8226ff5942d9e [2022-07-23 04:25:46,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:25:46,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:25:46,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:25:46,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:25:46,115 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:25:46,116 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--gadget--udc--net2272.ko.cil.i [2022-07-23 04:25:46,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff460ec8/0301dbc1f41c4f09adb20b956f984bb7/FLAGe07ec187f [2022-07-23 04:25:47,019 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:25:47,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-23 04:25:47,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff460ec8/0301dbc1f41c4f09adb20b956f984bb7/FLAGe07ec187f [2022-07-23 04:25:47,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff460ec8/0301dbc1f41c4f09adb20b956f984bb7 [2022-07-23 04:25:47,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:25:47,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:25:47,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:25:47,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:25:47,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:25:47,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:25:47" (1/1) ... [2022-07-23 04:25:47,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1748b52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:47, skipping insertion in model container [2022-07-23 04:25:47,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:25:47" (1/1) ... [2022-07-23 04:25:47,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:25:47,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:25:51,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-23 04:25:51,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-23 04:25:51,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-23 04:25:51,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-23 04:25:51,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-23 04:25:51,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-23 04:25:51,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-23 04:25:51,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-23 04:25:51,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-23 04:25:51,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-23 04:25:51,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-23 04:25:51,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-23 04:25:51,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-23 04:25:51,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-23 04:25:51,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-23 04:25:51,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-23 04:25:51,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-23 04:25:51,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-23 04:25:51,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-23 04:25:51,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-23 04:25:51,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-23 04:25:51,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-23 04:25:51,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-23 04:25:51,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-23 04:25:51,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378205,378218] [2022-07-23 04:25:51,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378348,378361] [2022-07-23 04:25:51,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378500,378513] [2022-07-23 04:25:51,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378646,378659] [2022-07-23 04:25:51,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378791,378804] [2022-07-23 04:25:51,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378945,378958] [2022-07-23 04:25:51,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379096,379109] [2022-07-23 04:25:51,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379251,379264] [2022-07-23 04:25:51,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379403,379416] [2022-07-23 04:25:51,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379558,379571] [2022-07-23 04:25:51,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379722,379735] [2022-07-23 04:25:51,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379878,379891] [2022-07-23 04:25:51,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380042,380055] [2022-07-23 04:25:51,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380184,380197] [2022-07-23 04:25:51,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380342,380355] [2022-07-23 04:25:51,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380509,380522] [2022-07-23 04:25:51,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380668,380681] [2022-07-23 04:25:51,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380827,380840] [2022-07-23 04:25:51,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380976,380989] [2022-07-23 04:25:51,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381123,381136] [2022-07-23 04:25:51,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381262,381275] [2022-07-23 04:25:51,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381425,381438] [2022-07-23 04:25:51,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381591,381604] [2022-07-23 04:25:51,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381755,381768] [2022-07-23 04:25:51,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381920,381933] [2022-07-23 04:25:51,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382085,382098] [2022-07-23 04:25:51,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382251,382264] [2022-07-23 04:25:51,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382416,382429] [2022-07-23 04:25:51,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382583,382596] [2022-07-23 04:25:51,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382743,382756] [2022-07-23 04:25:51,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382905,382918] [2022-07-23 04:25:51,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383064,383077] [2022-07-23 04:25:51,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383210,383223] [2022-07-23 04:25:51,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383353,383366] [2022-07-23 04:25:51,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383497,383510] [2022-07-23 04:25:51,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383640,383653] [2022-07-23 04:25:51,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383784,383797] [2022-07-23 04:25:51,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383925,383938] [2022-07-23 04:25:51,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384063,384076] [2022-07-23 04:25:51,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384221,384234] [2022-07-23 04:25:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384380,384393] [2022-07-23 04:25:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384536,384549] [2022-07-23 04:25:51,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384685,384698] [2022-07-23 04:25:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384837,384850] [2022-07-23 04:25:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384988,385001] [2022-07-23 04:25:51,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385137,385150] [2022-07-23 04:25:51,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385289,385302] [2022-07-23 04:25:51,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385437,385450] [2022-07-23 04:25:51,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385590,385603] [2022-07-23 04:25:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385741,385754] [2022-07-23 04:25:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385891,385904] [2022-07-23 04:25:51,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386038,386051] [2022-07-23 04:25:51,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386189,386202] [2022-07-23 04:25:51,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386340,386353] [2022-07-23 04:25:51,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386488,386501] [2022-07-23 04:25:51,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386654,386667] [2022-07-23 04:25:51,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386823,386836] [2022-07-23 04:25:51,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386990,387003] [2022-07-23 04:25:51,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387158,387171] [2022-07-23 04:25:51,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387308,387321] [2022-07-23 04:25:51,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387455,387468] [2022-07-23 04:25:51,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387616,387629] [2022-07-23 04:25:51,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387786,387799] [2022-07-23 04:25:51,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387948,387961] [2022-07-23 04:25:51,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:25:51,420 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:25:51,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-23 04:25:51,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-23 04:25:51,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-23 04:25:51,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-23 04:25:51,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-23 04:25:51,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-23 04:25:51,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-23 04:25:51,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-23 04:25:51,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-23 04:25:51,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-23 04:25:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-23 04:25:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-23 04:25:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-23 04:25:51,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-23 04:25:51,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-23 04:25:51,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-23 04:25:51,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-23 04:25:51,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-23 04:25:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-23 04:25:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-23 04:25:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-23 04:25:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-23 04:25:51,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-23 04:25:51,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-23 04:25:51,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378205,378218] [2022-07-23 04:25:51,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378348,378361] [2022-07-23 04:25:51,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378500,378513] [2022-07-23 04:25:51,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378646,378659] [2022-07-23 04:25:51,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378791,378804] [2022-07-23 04:25:51,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378945,378958] [2022-07-23 04:25:51,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379096,379109] [2022-07-23 04:25:51,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379251,379264] [2022-07-23 04:25:51,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379403,379416] [2022-07-23 04:25:51,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379558,379571] [2022-07-23 04:25:51,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379722,379735] [2022-07-23 04:25:51,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379878,379891] [2022-07-23 04:25:51,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380042,380055] [2022-07-23 04:25:51,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380184,380197] [2022-07-23 04:25:51,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380342,380355] [2022-07-23 04:25:51,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380509,380522] [2022-07-23 04:25:51,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380668,380681] [2022-07-23 04:25:51,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380827,380840] [2022-07-23 04:25:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380976,380989] [2022-07-23 04:25:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381123,381136] [2022-07-23 04:25:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381262,381275] [2022-07-23 04:25:51,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381425,381438] [2022-07-23 04:25:51,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381591,381604] [2022-07-23 04:25:51,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381755,381768] [2022-07-23 04:25:51,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381920,381933] [2022-07-23 04:25:51,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382085,382098] [2022-07-23 04:25:51,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382251,382264] [2022-07-23 04:25:51,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382416,382429] [2022-07-23 04:25:51,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382583,382596] [2022-07-23 04:25:51,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382743,382756] [2022-07-23 04:25:51,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382905,382918] [2022-07-23 04:25:51,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383064,383077] [2022-07-23 04:25:51,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383210,383223] [2022-07-23 04:25:51,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383353,383366] [2022-07-23 04:25:51,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383497,383510] [2022-07-23 04:25:51,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383640,383653] [2022-07-23 04:25:51,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383784,383797] [2022-07-23 04:25:51,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383925,383938] [2022-07-23 04:25:51,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384063,384076] [2022-07-23 04:25:51,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384221,384234] [2022-07-23 04:25:51,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384380,384393] [2022-07-23 04:25:51,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384536,384549] [2022-07-23 04:25:51,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384685,384698] [2022-07-23 04:25:51,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384837,384850] [2022-07-23 04:25:51,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384988,385001] [2022-07-23 04:25:51,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385137,385150] [2022-07-23 04:25:51,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385289,385302] [2022-07-23 04:25:51,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385437,385450] [2022-07-23 04:25:51,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385590,385603] [2022-07-23 04:25:51,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385741,385754] [2022-07-23 04:25:51,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385891,385904] [2022-07-23 04:25:51,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386038,386051] [2022-07-23 04:25:51,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386189,386202] [2022-07-23 04:25:51,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386340,386353] [2022-07-23 04:25:51,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386488,386501] [2022-07-23 04:25:51,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386654,386667] [2022-07-23 04:25:51,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386823,386836] [2022-07-23 04:25:51,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386990,387003] [2022-07-23 04:25:51,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387158,387171] [2022-07-23 04:25:51,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387308,387321] [2022-07-23 04:25:51,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387455,387468] [2022-07-23 04:25:51,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387616,387629] [2022-07-23 04:25:51,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387786,387799] [2022-07-23 04:25:51,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387948,387961] [2022-07-23 04:25:51,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:25:52,043 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:25:52,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52 WrapperNode [2022-07-23 04:25:52,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:25:52,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:25:52,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:25:52,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:25:52,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,508 INFO L137 Inliner]: procedures = 640, calls = 2778, calls flagged for inlining = 295, calls inlined = 219, statements flattened = 6490 [2022-07-23 04:25:52,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:25:52,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:25:52,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:25:52,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:25:52,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:52,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:53,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:25:53,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:25:53,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:25:53,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:25:53,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (1/1) ... [2022-07-23 04:25:53,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:25:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:25:53,202 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-23 04:25:53,259 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-23 04:25:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-23 04:25:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-23 04:25:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:25:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:25:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:25:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:25:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_wakeup [2022-07-23 04:25:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_wakeup [2022-07-23 04:25:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read_fifo [2022-07-23 04:25:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read_fifo [2022-07-23 04:25:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write_fifo [2022-07-23 04:25:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write_fifo [2022-07-23 04:25:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:25:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:25:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-23 04:25:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-23 04:25:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-23 04:25:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-23 04:25:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:25:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:25:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-23 04:25:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-23 04:25:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:25:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:25:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read [2022-07-23 04:25:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read [2022-07-23 04:25:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-23 04:25:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-23 04:25:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_enable [2022-07-23 04:25:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_enable [2022-07-23 04:25:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pio_advance [2022-07-23 04:25:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pio_advance [2022-07-23 04:25:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:25:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:25:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:25:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:25:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure set_fifo_bytecount [2022-07-23 04:25:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure set_fifo_bytecount [2022-07-23 04:25:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reset [2022-07-23 04:25:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reset [2022-07-23 04:25:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:25:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:25:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:25:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:25:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:25:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:25:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reinit [2022-07-23 04:25:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reinit [2022-07-23 04:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_unregister [2022-07-23 04:25:53,345 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_unregister [2022-07-23 04:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-23 04:25:53,345 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-23 04:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_101 [2022-07-23 04:25:53,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_101 [2022-07-23 04:25:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure type_string [2022-07-23 04:25:53,361 INFO L138 BoogieDeclarations]: Found implementation of procedure type_string [2022-07-23 04:25:53,361 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_gadget_release [2022-07-23 04:25:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_gadget_release [2022-07-23 04:25:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:25:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:25:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_dma [2022-07-23 04:25:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_dma [2022-07-23 04:25:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure allow_status [2022-07-23 04:25:53,362 INFO L138 BoogieDeclarations]: Found implementation of procedure allow_status [2022-07-23 04:25:53,362 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 04:25:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 04:25:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:25:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:25:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:25:53,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:25:53,363 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_request_dma [2022-07-23 04:25:53,365 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_request_dma [2022-07-23 04:25:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:25:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:25:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:25:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:25:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:25:53,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:25:53,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 04:25:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 04:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_read [2022-07-23 04:25:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_read [2022-07-23 04:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-23 04:25:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-23 04:25:53,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:25:53,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:25:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 04:25:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 04:25:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:25:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:25:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_check_return_value_probe [2022-07-23 04:25:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_check_return_value_probe [2022-07-23 04:25:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_halt_and_wedge [2022-07-23 04:25:53,368 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_halt_and_wedge [2022-07-23 04:25:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:25:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-23 04:25:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-23 04:25:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-23 04:25:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-23 04:25:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:25:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:25:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:25:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 04:25:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 04:25:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:25:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:25:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:25:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:25:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:25:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure set_halt [2022-07-23 04:25:53,383 INFO L138 BoogieDeclarations]: Found implementation of procedure set_halt [2022-07-23 04:25:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ep_set_maxpacket_limit [2022-07-23 04:25:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ep_set_maxpacket_limit [2022-07-23 04:25:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:25:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:25:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-23 04:25:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-23 04:25:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_wedge [2022-07-23 04:25:53,384 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_wedge [2022-07-23 04:25:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_reset [2022-07-23 04:25:53,385 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_reset [2022-07-23 04:25:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-23 04:25:53,385 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-23 04:25:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-23 04:25:53,385 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-23 04:25:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:25:53,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:25:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure stop_activity [2022-07-23 04:25:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_activity [2022-07-23 04:25:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-23 04:25:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-23 04:25:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:25:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:25:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_irq [2022-07-23 04:25:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_irq [2022-07-23 04:25:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_ep [2022-07-23 04:25:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_ep [2022-07-23 04:25:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_start [2022-07-23 04:25:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_start [2022-07-23 04:25:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_write [2022-07-23 04:25:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_write [2022-07-23 04:25:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_probe [2022-07-23 04:25:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_probe [2022-07-23 04:25:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:25:53,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:25:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_fin [2022-07-23 04:25:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_fin [2022-07-23 04:25:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_flush [2022-07-23 04:25:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_flush [2022-07-23 04:25:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_done [2022-07-23 04:25:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_done [2022-07-23 04:25:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_cancel_dma [2022-07-23 04:25:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_cancel_dma [2022-07-23 04:25:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-23 04:25:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-23 04:25:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue_all [2022-07-23 04:25:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue_all [2022-07-23 04:25:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_post_probe [2022-07-23 04:25:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_post_probe [2022-07-23 04:25:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_init [2022-07-23 04:25:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_init [2022-07-23 04:25:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:25:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:25:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-23 04:25:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-23 04:25:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_remove [2022-07-23 04:25:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_remove [2022-07-23 04:25:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:25:53,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:25:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:25:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-23 04:25:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-23 04:25:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:25:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:25:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_status [2022-07-23 04:25:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_status [2022-07-23 04:25:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:25:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq_130 [2022-07-23 04:25:53,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq_130 [2022-07-23 04:25:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_isoc [2022-07-23 04:25:53,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_isoc [2022-07-23 04:25:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure buf_state_string [2022-07-23 04:25:53,392 INFO L138 BoogieDeclarations]: Found implementation of procedure buf_state_string [2022-07-23 04:25:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure clear_halt [2022-07-23 04:25:53,392 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_halt [2022-07-23 04:25:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-23 04:25:53,393 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-23 04:25:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_stop [2022-07-23 04:25:53,393 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_stop [2022-07-23 04:25:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:25:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:25:53,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 04:25:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2022-07-23 04:25:53,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pre_probe [2022-07-23 04:25:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_reg_addr [2022-07-23 04:25:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_reg_addr [2022-07-23 04:25:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-23 04:25:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-23 04:25:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 04:25:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 04:25:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_probe [2022-07-23 04:25:53,394 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_probe [2022-07-23 04:25:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:25:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:25:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-23 04:25:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-23 04:25:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_irq_register_11_2 [2022-07-23 04:25:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_irq_register_11_2 [2022-07-23 04:25:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:25:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:25:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write [2022-07-23 04:25:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write [2022-07-23 04:25:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-23 04:25:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-23 04:25:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:25:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:25:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_remove [2022-07-23 04:25:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_remove [2022-07-23 04:25:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-23 04:25:53,397 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-23 04:25:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep0_start [2022-07-23 04:25:53,397 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep0_start [2022-07-23 04:25:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:25:53,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:25:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:25:53,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:25:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:25:53,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:25:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_remove [2022-07-23 04:25:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_remove [2022-07-23 04:25:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_disable [2022-07-23 04:25:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_disable [2022-07-23 04:25:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:25:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:25:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-23 04:25:53,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-23 04:25:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:25:53,399 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:25:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:25:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_stat0_irqs [2022-07-23 04:25:53,399 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_stat0_irqs [2022-07-23 04:25:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:25:53,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:25:53,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:25:53,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:25:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_frame [2022-07-23 04:25:53,400 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_frame [2022-07-23 04:25:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:25:53,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:25:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_102 [2022-07-23 04:25:53,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_102 [2022-07-23 04:25:53,400 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_ep_by_addr [2022-07-23 04:25:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_ep_by_addr [2022-07-23 04:25:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-23 04:25:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-23 04:25:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:25:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:25:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:25:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:25:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_instance_handler_0_5 [2022-07-23 04:25:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_instance_handler_0_5 [2022-07-23 04:25:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-23 04:25:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-23 04:25:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_kick_dma [2022-07-23 04:25:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_kick_dma [2022-07-23 04:25:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue [2022-07-23 04:25:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue [2022-07-23 04:25:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:25:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-23 04:25:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-07-23 04:25:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-23 04:25:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-23 04:25:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-23 04:25:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-23 04:25:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-23 04:25:54,329 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:25:54,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:25:54,745 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:25:55,114 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 04:25:55,232 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4822: SUMMARY for call assert_out_naking_#t~ret118#1 := ldv__builtin_expect(assert_out_naking_#t~mem117#1 % 256, 0); srcloc: null [2022-07-23 04:25:55,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4822-1: assume -9223372036854775808 <= assert_out_naking_#t~ret118#1 && assert_out_naking_#t~ret118#1 <= 9223372036854775807;assert_out_naking_~tmp___0~4#1 := assert_out_naking_#t~ret118#1;havoc assert_out_naking_#t~mem117#1;havoc assert_out_naking_#t~ret118#1; [2022-07-23 04:25:55,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4814: call ULTIMATE.dealloc(assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset);havoc assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset; [2022-07-23 04:25:55,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4832: SUMMARY for call net2272_ep_write(assert_out_naking_~ep#1.base, assert_out_naking_~ep#1.offset, 15, 128); srcloc: null [2022-07-23 04:25:55,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: goto; [2022-07-23 04:25:55,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: assume 0 != assert_out_naking_~tmp___0~4#1;call assert_out_naking_#t~mem119#1.base, assert_out_naking_#t~mem119#1.offset := read~$Pointer$(assert_out_naking_~ep#1.base, 65 + assert_out_naking_~ep#1.offset, 8);call assert_out_naking_#t~mem120#1.base, assert_out_naking_#t~mem120#1.offset := read~$Pointer$(assert_out_naking_#t~mem119#1.base, 1481 + assert_out_naking_#t~mem119#1.offset, 8);call assert_out_naking_#t~mem121#1.base, assert_out_naking_#t~mem121#1.offset := read~$Pointer$(assert_out_naking_~ep#1.base, 8 + assert_out_naking_~ep#1.offset, 8);havoc assert_out_naking_#t~mem119#1.base, assert_out_naking_#t~mem119#1.offset;havoc assert_out_naking_#t~mem120#1.base, assert_out_naking_#t~mem120#1.offset;havoc assert_out_naking_#t~mem121#1.base, assert_out_naking_#t~mem121#1.offset; [2022-07-23 04:25:55,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !(0 != assert_out_naking_~tmp___0~4#1); [2022-07-23 04:25:55,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !(0 == (if 0 == assert_out_naking_~tmp~9#1 % 256 then 0 else (if 1 == assert_out_naking_~tmp~9#1 % 256 then 0 else ~bitwiseAnd(assert_out_naking_~tmp~9#1 % 256, 32)))); [2022-07-23 04:25:55,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume 0 == (if 0 == assert_out_naking_~tmp~9#1 % 256 then 0 else (if 1 == assert_out_naking_~tmp~9#1 % 256 then 0 else ~bitwiseAnd(assert_out_naking_~tmp~9#1 % 256, 32)));call write~$Pointer$(4, 0, assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(5, 0, assert_out_naking_~#descriptor~0#1.base, 8 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(6, 0, assert_out_naking_~#descriptor~0#1.base, 16 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(7, 0, assert_out_naking_~#descriptor~0#1.base, 24 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~int(131, assert_out_naking_~#descriptor~0#1.base, 32 + assert_out_naking_~#descriptor~0#1.offset, 4);call write~int(0, assert_out_naking_~#descriptor~0#1.base, 36 + assert_out_naking_~#descriptor~0#1.offset, 1);call assert_out_naking_#t~mem117#1 := read~int(assert_out_naking_~#descriptor~0#1.base, 36 + assert_out_naking_~#descriptor~0#1.offset, 1); [2022-07-23 04:25:58,950 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:25:58,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:25:58,969 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:25:58,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:25:58 BoogieIcfgContainer [2022-07-23 04:25:58,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:25:58,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:25:58,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:25:58,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:25:58,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:25:47" (1/3) ... [2022-07-23 04:25:58,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a327cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:25:58, skipping insertion in model container [2022-07-23 04:25:58,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:25:52" (2/3) ... [2022-07-23 04:25:58,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a327cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:25:58, skipping insertion in model container [2022-07-23 04:25:58,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:25:58" (3/3) ... [2022-07-23 04:25:58,988 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-23 04:25:59,003 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:25:59,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 04:25:59,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:25:59,147 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@3107c8e4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14e0dd66 [2022-07-23 04:25:59,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 04:25:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 2572 states, 1698 states have (on average 1.3409893992932862) internal successors, (2277), 1788 states have internal predecessors, (2277), 711 states have call successors, (711), 135 states have call predecessors, (711), 134 states have return successors, (703), 687 states have call predecessors, (703), 703 states have call successors, (703) [2022-07-23 04:25:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 04:25:59,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:25:59,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:25:59,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:25:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:25:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1907190920, now seen corresponding path program 1 times [2022-07-23 04:25:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:25:59,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613353793] [2022-07-23 04:25:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:25:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:25:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:25:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:25:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:25:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:25:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:25:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:25:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:25:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:25:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:25:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:25:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:25:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:25:59,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613353793] [2022-07-23 04:25:59,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613353793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:25:59,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:25:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:25:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257472191] [2022-07-23 04:25:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:25:59,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:25:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:25:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:25:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:25:59,955 INFO L87 Difference]: Start difference. First operand has 2572 states, 1698 states have (on average 1.3409893992932862) internal successors, (2277), 1788 states have internal predecessors, (2277), 711 states have call successors, (711), 135 states have call predecessors, (711), 134 states have return successors, (703), 687 states have call predecessors, (703), 703 states have call successors, (703) Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:26:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:12,288 INFO L93 Difference]: Finished difference Result 7591 states and 11348 transitions. [2022-07-23 04:26:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:26:12,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-23 04:26:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:12,358 INFO L225 Difference]: With dead ends: 7591 [2022-07-23 04:26:12,359 INFO L226 Difference]: Without dead ends: 5012 [2022-07-23 04:26:12,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:26:12,388 INFO L413 NwaCegarLoop]: 3514 mSDtfsCounter, 8535 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 8331 mSolverCounterSat, 5578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8729 SdHoareTripleChecker+Valid, 6481 SdHoareTripleChecker+Invalid, 13909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5578 IncrementalHoareTripleChecker+Valid, 8331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:12,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8729 Valid, 6481 Invalid, 13909 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5578 Valid, 8331 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-07-23 04:26:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2022-07-23 04:26:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4815. [2022-07-23 04:26:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4815 states, 3202 states have (on average 1.2951280449718925) internal successors, (4147), 3346 states have internal predecessors, (4147), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-23 04:26:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 6885 transitions. [2022-07-23 04:26:12,761 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 6885 transitions. Word has length 66 [2022-07-23 04:26:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:12,763 INFO L495 AbstractCegarLoop]: Abstraction has 4815 states and 6885 transitions. [2022-07-23 04:26:12,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-23 04:26:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 6885 transitions. [2022-07-23 04:26:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-23 04:26:12,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:12,774 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:26:12,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:26:12,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 259434772, now seen corresponding path program 1 times [2022-07-23 04:26:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161847960] [2022-07-23 04:26:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:26:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:26:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:26:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:26:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:26:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:26:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:26:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161847960] [2022-07-23 04:26:13,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161847960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:13,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:13,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:26:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105784427] [2022-07-23 04:26:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:13,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:26:13,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:26:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:26:13,183 INFO L87 Difference]: Start difference. First operand 4815 states and 6885 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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-23 04:26:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:19,638 INFO L93 Difference]: Finished difference Result 4815 states and 6885 transitions. [2022-07-23 04:26:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:26:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 72 [2022-07-23 04:26:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:19,678 INFO L225 Difference]: With dead ends: 4815 [2022-07-23 04:26:19,678 INFO L226 Difference]: Without dead ends: 4813 [2022-07-23 04:26:19,684 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-23 04:26:19,685 INFO L413 NwaCegarLoop]: 3102 mSDtfsCounter, 5580 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5802 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 6996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:19,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5802 Valid, 5058 Invalid, 6996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 04:26:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2022-07-23 04:26:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4813. [2022-07-23 04:26:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 3201 states have (on average 1.2949078412995938) internal successors, (4145), 3344 states have internal predecessors, (4145), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-23 04:26:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6883 transitions. [2022-07-23 04:26:19,911 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6883 transitions. Word has length 72 [2022-07-23 04:26:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6883 transitions. [2022-07-23 04:26:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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-23 04:26:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6883 transitions. [2022-07-23 04:26:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-23 04:26:19,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:19,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:26:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:26:19,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -458841926, now seen corresponding path program 1 times [2022-07-23 04:26:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185987726] [2022-07-23 04:26:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:26:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:26:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:26:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:26:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:26:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:26:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:26:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:26:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185987726] [2022-07-23 04:26:20,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185987726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:26:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302867789] [2022-07-23 04:26:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:26:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:26:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:26:20,316 INFO L87 Difference]: Start difference. First operand 4813 states and 6883 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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-23 04:26:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:25,709 INFO L93 Difference]: Finished difference Result 4813 states and 6883 transitions. [2022-07-23 04:26:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:26:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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 78 [2022-07-23 04:26:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:25,739 INFO L225 Difference]: With dead ends: 4813 [2022-07-23 04:26:25,739 INFO L226 Difference]: Without dead ends: 4811 [2022-07-23 04:26:25,744 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-23 04:26:25,744 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5574 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5795 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 6994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:25,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5795 Valid, 5056 Invalid, 6994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:26:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2022-07-23 04:26:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4811. [2022-07-23 04:26:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 3200 states have (on average 1.2946875) internal successors, (4143), 3342 states have internal predecessors, (4143), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-23 04:26:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6881 transitions. [2022-07-23 04:26:26,015 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6881 transitions. Word has length 78 [2022-07-23 04:26:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:26,016 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6881 transitions. [2022-07-23 04:26:26,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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-23 04:26:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6881 transitions. [2022-07-23 04:26:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-23 04:26:26,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:26,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:26:26,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:26:26,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash 134960499, now seen corresponding path program 1 times [2022-07-23 04:26:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:26,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808835987] [2022-07-23 04:26:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:26:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:26:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:26:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:26:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:26:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:26:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:26:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:26:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:26:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:26,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808835987] [2022-07-23 04:26:26,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808835987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:26,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:26,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:26:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083173139] [2022-07-23 04:26:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:26:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:26:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:26:26,324 INFO L87 Difference]: Start difference. First operand 4811 states and 6881 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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-23 04:26:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:31,272 INFO L93 Difference]: Finished difference Result 4811 states and 6881 transitions. [2022-07-23 04:26:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:26:31,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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 84 [2022-07-23 04:26:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:31,297 INFO L225 Difference]: With dead ends: 4811 [2022-07-23 04:26:31,297 INFO L226 Difference]: Without dead ends: 4809 [2022-07-23 04:26:31,300 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-23 04:26:31,301 INFO L413 NwaCegarLoop]: 3098 mSDtfsCounter, 5568 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5788 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 6992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:31,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5788 Valid, 5054 Invalid, 6992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-23 04:26:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2022-07-23 04:26:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2022-07-23 04:26:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 3199 states have (on average 1.294467020944045) internal successors, (4141), 3340 states have internal predecessors, (4141), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-23 04:26:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6879 transitions. [2022-07-23 04:26:31,499 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6879 transitions. Word has length 84 [2022-07-23 04:26:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:31,500 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6879 transitions. [2022-07-23 04:26:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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-23 04:26:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6879 transitions. [2022-07-23 04:26:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-23 04:26:31,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:31,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:26:31,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:26:31,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1947085320, now seen corresponding path program 1 times [2022-07-23 04:26:31,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:31,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361390686] [2022-07-23 04:26:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:26:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:26:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:26:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:26:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:26:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:26:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:26:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:26:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:26:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:26:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:31,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361390686] [2022-07-23 04:26:31,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361390686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:31,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:31,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:26:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084424388] [2022-07-23 04:26:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:31,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:26:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:26:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:26:31,814 INFO L87 Difference]: Start difference. First operand 4809 states and 6879 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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-23 04:26:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:36,923 INFO L93 Difference]: Finished difference Result 4809 states and 6879 transitions. [2022-07-23 04:26:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:26:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 90 [2022-07-23 04:26:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:36,950 INFO L225 Difference]: With dead ends: 4809 [2022-07-23 04:26:36,950 INFO L226 Difference]: Without dead ends: 4807 [2022-07-23 04:26:36,954 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-23 04:26:36,954 INFO L413 NwaCegarLoop]: 3096 mSDtfsCounter, 5562 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 5052 SdHoareTripleChecker+Invalid, 6990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:36,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 5052 Invalid, 6990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-23 04:26:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2022-07-23 04:26:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2022-07-23 04:26:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 3198 states have (on average 1.2942464040025015) internal successors, (4139), 3338 states have internal predecessors, (4139), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-23 04:26:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6877 transitions. [2022-07-23 04:26:37,182 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6877 transitions. Word has length 90 [2022-07-23 04:26:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:37,183 INFO L495 AbstractCegarLoop]: Abstraction has 4807 states and 6877 transitions. [2022-07-23 04:26:37,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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-23 04:26:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6877 transitions. [2022-07-23 04:26:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:26:37,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:37,191 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-23 04:26:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:26:37,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting kzallocErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash 674168724, now seen corresponding path program 1 times [2022-07-23 04:26:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:37,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347663782] [2022-07-23 04:26:37,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:26:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:26:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:26:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:26:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:26:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:26:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:26:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:26:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:26:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:37,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347663782] [2022-07-23 04:26:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347663782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:26:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810745535] [2022-07-23 04:26:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:26:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:26:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:26:37,543 INFO L87 Difference]: Start difference. First operand 4807 states and 6877 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:26:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:51,268 INFO L93 Difference]: Finished difference Result 12257 states and 17686 transitions. [2022-07-23 04:26:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:26:51,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2022-07-23 04:26:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:51,312 INFO L225 Difference]: With dead ends: 12257 [2022-07-23 04:26:51,312 INFO L226 Difference]: Without dead ends: 7471 [2022-07-23 04:26:51,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:26:51,338 INFO L413 NwaCegarLoop]: 3215 mSDtfsCounter, 8990 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 14904 mSolverCounterSat, 6118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9189 SdHoareTripleChecker+Valid, 7114 SdHoareTripleChecker+Invalid, 21022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6118 IncrementalHoareTripleChecker+Valid, 14904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:51,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9189 Valid, 7114 Invalid, 21022 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6118 Valid, 14904 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-07-23 04:26:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-23 04:26:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7257. [2022-07-23 04:26:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 4810 states have (on average 1.286070686070686) internal successors, (6186), 4996 states have internal predecessors, (6186), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:26:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 10327 transitions. [2022-07-23 04:26:51,685 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 10327 transitions. Word has length 120 [2022-07-23 04:26:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:51,686 INFO L495 AbstractCegarLoop]: Abstraction has 7257 states and 10327 transitions. [2022-07-23 04:26:51,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:26:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 10327 transitions. [2022-07-23 04:26:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:26:51,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:51,688 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-23 04:26:51,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:26:51,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting kzallocErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash 674228306, now seen corresponding path program 1 times [2022-07-23 04:26:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:51,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148453330] [2022-07-23 04:26:51,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:26:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:26:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:26:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:26:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:26:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:26:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:26:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:26:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:26:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:26:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:26:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:26:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:26:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:26:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:26:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:26:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:26:52,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148453330] [2022-07-23 04:26:52,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148453330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:26:52,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:26:52,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:26:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975239820] [2022-07-23 04:26:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:26:52,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:26:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:26:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:26:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:26:52,035 INFO L87 Difference]: Start difference. First operand 7257 states and 10327 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-23 04:26:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:26:59,517 INFO L93 Difference]: Finished difference Result 7487 states and 10683 transitions. [2022-07-23 04:26:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:26:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2022-07-23 04:26:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:26:59,556 INFO L225 Difference]: With dead ends: 7487 [2022-07-23 04:26:59,557 INFO L226 Difference]: Without dead ends: 7485 [2022-07-23 04:26:59,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-07-23 04:26:59,565 INFO L413 NwaCegarLoop]: 3113 mSDtfsCounter, 4433 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 7952 mSolverCounterSat, 3513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 6438 SdHoareTripleChecker+Invalid, 11465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3513 IncrementalHoareTripleChecker+Valid, 7952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:26:59,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 6438 Invalid, 11465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3513 Valid, 7952 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 04:26:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2022-07-23 04:26:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7261. [2022-07-23 04:26:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7261 states, 4814 states have (on average 1.2854175321977566) internal successors, (6188), 5000 states have internal predecessors, (6188), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:26:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 10329 transitions. [2022-07-23 04:26:59,902 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 10329 transitions. Word has length 120 [2022-07-23 04:26:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:26:59,903 INFO L495 AbstractCegarLoop]: Abstraction has 7261 states and 10329 transitions. [2022-07-23 04:26:59,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-23 04:26:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 10329 transitions. [2022-07-23 04:26:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-23 04:26:59,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:26:59,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:26:59,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:26:59,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:26:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:26:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1135512486, now seen corresponding path program 1 times [2022-07-23 04:26:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:26:59,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407604785] [2022-07-23 04:26:59,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:26:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:26:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:27:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:27:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:27:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:27:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:27:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407604785] [2022-07-23 04:27:00,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407604785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:00,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:00,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354278069] [2022-07-23 04:27:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:00,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:00,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:00,187 INFO L87 Difference]: Start difference. First operand 7261 states and 10329 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-23 04:27:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:05,633 INFO L93 Difference]: Finished difference Result 7261 states and 10329 transitions. [2022-07-23 04:27:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 96 [2022-07-23 04:27:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:05,672 INFO L225 Difference]: With dead ends: 7261 [2022-07-23 04:27:05,672 INFO L226 Difference]: Without dead ends: 7259 [2022-07-23 04:27:05,680 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-23 04:27:05,681 INFO L413 NwaCegarLoop]: 3094 mSDtfsCounter, 5556 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5774 SdHoareTripleChecker+Valid, 5050 SdHoareTripleChecker+Invalid, 6988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:05,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5774 Valid, 5050 Invalid, 6988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:27:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2022-07-23 04:27:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 7259. [2022-07-23 04:27:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7259 states, 4813 states have (on average 1.2852690629544983) internal successors, (6186), 4998 states have internal predecessors, (6186), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:27:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 10327 transitions. [2022-07-23 04:27:06,106 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 10327 transitions. Word has length 96 [2022-07-23 04:27:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:06,106 INFO L495 AbstractCegarLoop]: Abstraction has 7259 states and 10327 transitions. [2022-07-23 04:27:06,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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-23 04:27:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 10327 transitions. [2022-07-23 04:27:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-23 04:27:06,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:06,110 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:27:06,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:27:06,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting kzallocErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1329569048, now seen corresponding path program 1 times [2022-07-23 04:27:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161683770] [2022-07-23 04:27:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:27:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:27:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:27:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:27:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:27:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:27:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:27:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:27:06,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161683770] [2022-07-23 04:27:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161683770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:06,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:06,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616121266] [2022-07-23 04:27:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:06,461 INFO L87 Difference]: Start difference. First operand 7259 states and 10327 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:27:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:12,003 INFO L93 Difference]: Finished difference Result 14673 states and 21127 transitions. [2022-07-23 04:27:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:12,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2022-07-23 04:27:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:12,036 INFO L225 Difference]: With dead ends: 14673 [2022-07-23 04:27:12,036 INFO L226 Difference]: Without dead ends: 7435 [2022-07-23 04:27:12,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 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-23 04:27:12,067 INFO L413 NwaCegarLoop]: 3107 mSDtfsCounter, 6756 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 4524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6982 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 6836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4524 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:12,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6982 Valid, 4816 Invalid, 6836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4524 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:27:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-07-23 04:27:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7249. [2022-07-23 04:27:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 4804 states have (on average 1.2841382181515404) internal successors, (6169), 4988 states have internal predecessors, (6169), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:27:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10310 transitions. [2022-07-23 04:27:12,406 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10310 transitions. Word has length 124 [2022-07-23 04:27:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:12,407 INFO L495 AbstractCegarLoop]: Abstraction has 7249 states and 10310 transitions. [2022-07-23 04:27:12,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:27:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10310 transitions. [2022-07-23 04:27:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 04:27:12,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:12,409 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:27:12,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:27:12,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_net_register_check_return_value_probeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash -336041078, now seen corresponding path program 1 times [2022-07-23 04:27:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753734849] [2022-07-23 04:27:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:27:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:27:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:27:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 04:27:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:27:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-23 04:27:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:12,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753734849] [2022-07-23 04:27:12,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753734849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:12,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:12,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610441479] [2022-07-23 04:27:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:12,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:12,645 INFO L87 Difference]: Start difference. First operand 7249 states and 10310 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:27:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:17,777 INFO L93 Difference]: Finished difference Result 14657 states and 20892 transitions. [2022-07-23 04:27:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:27:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2022-07-23 04:27:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:17,812 INFO L225 Difference]: With dead ends: 14657 [2022-07-23 04:27:17,813 INFO L226 Difference]: Without dead ends: 7429 [2022-07-23 04:27:17,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 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-23 04:27:17,844 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 6755 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 4534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6983 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 7094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4534 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:17,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6983 Valid, 4557 Invalid, 7094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4534 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-23 04:27:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2022-07-23 04:27:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7243. [2022-07-23 04:27:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7243 states, 4799 states have (on average 1.2836007501562825) internal successors, (6160), 4982 states have internal predecessors, (6160), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:27:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 10301 transitions. [2022-07-23 04:27:18,187 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 10301 transitions. Word has length 113 [2022-07-23 04:27:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 7243 states and 10301 transitions. [2022-07-23 04:27:18,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:27:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 10301 transitions. [2022-07-23 04:27:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-23 04:27:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:18,190 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:27:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:27:18,190 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 5687637, now seen corresponding path program 1 times [2022-07-23 04:27:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596161852] [2022-07-23 04:27:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:27:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:27:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:27:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:27:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:27:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:27:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596161852] [2022-07-23 04:27:18,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596161852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:18,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:18,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303159406] [2022-07-23 04:27:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:18,421 INFO L87 Difference]: Start difference. First operand 7243 states and 10301 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-23 04:27:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:23,851 INFO L93 Difference]: Finished difference Result 7243 states and 10301 transitions. [2022-07-23 04:27:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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 102 [2022-07-23 04:27:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:23,877 INFO L225 Difference]: With dead ends: 7243 [2022-07-23 04:27:23,877 INFO L226 Difference]: Without dead ends: 7241 [2022-07-23 04:27:23,884 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-23 04:27:23,885 INFO L413 NwaCegarLoop]: 3083 mSDtfsCounter, 5520 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5737 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 6975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:23,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5737 Valid, 5039 Invalid, 6975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:27:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2022-07-23 04:27:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7241. [2022-07-23 04:27:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 4798 states have (on average 1.283451438099208) internal successors, (6158), 4980 states have internal predecessors, (6158), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-23 04:27:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10299 transitions. [2022-07-23 04:27:24,244 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10299 transitions. Word has length 102 [2022-07-23 04:27:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:24,245 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 10299 transitions. [2022-07-23 04:27:24,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-23 04:27:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10299 transitions. [2022-07-23 04:27:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-23 04:27:24,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:24,247 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:27:24,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:27:24,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1765061470, now seen corresponding path program 1 times [2022-07-23 04:27:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838659866] [2022-07-23 04:27:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:27:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:27:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:27:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 04:27:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:27:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-23 04:27:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:24,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838659866] [2022-07-23 04:27:24,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838659866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:24,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:24,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:27:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14107550] [2022-07-23 04:27:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:24,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:27:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:27:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:27:24,601 INFO L87 Difference]: Start difference. First operand 7241 states and 10299 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:27:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:36,755 INFO L93 Difference]: Finished difference Result 10926 states and 15450 transitions. [2022-07-23 04:27:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:27:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2022-07-23 04:27:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:36,794 INFO L225 Difference]: With dead ends: 10926 [2022-07-23 04:27:36,794 INFO L226 Difference]: Without dead ends: 10924 [2022-07-23 04:27:36,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:27:36,802 INFO L413 NwaCegarLoop]: 3485 mSDtfsCounter, 7242 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 11771 mSolverCounterSat, 5289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7374 SdHoareTripleChecker+Valid, 6996 SdHoareTripleChecker+Invalid, 17060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5289 IncrementalHoareTripleChecker+Valid, 11771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:36,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7374 Valid, 6996 Invalid, 17060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5289 Valid, 11771 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-07-23 04:27:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2022-07-23 04:27:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 10550. [2022-07-23 04:27:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10550 states, 6975 states have (on average 1.2732616487455197) internal successors, (8881), 7227 states have internal predecessors, (8881), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-23 04:27:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 14874 transitions. [2022-07-23 04:27:37,418 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 14874 transitions. Word has length 119 [2022-07-23 04:27:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:37,418 INFO L495 AbstractCegarLoop]: Abstraction has 10550 states and 14874 transitions. [2022-07-23 04:27:37,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:27:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 14874 transitions. [2022-07-23 04:27:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:27:37,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:37,421 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:27:37,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:27:37,421 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1282682864, now seen corresponding path program 1 times [2022-07-23 04:27:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557722016] [2022-07-23 04:27:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:27:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:27:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:27:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:27:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:27:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:27:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557722016] [2022-07-23 04:27:37,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557722016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:37,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:37,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96453477] [2022-07-23 04:27:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:37,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:37,645 INFO L87 Difference]: Start difference. First operand 10550 states and 14874 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:27:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:43,325 INFO L93 Difference]: Finished difference Result 10550 states and 14874 transitions. [2022-07-23 04:27:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:43,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-23 04:27:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:43,361 INFO L225 Difference]: With dead ends: 10550 [2022-07-23 04:27:43,361 INFO L226 Difference]: Without dead ends: 10548 [2022-07-23 04:27:43,367 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-23 04:27:43,368 INFO L413 NwaCegarLoop]: 3081 mSDtfsCounter, 5518 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5734 SdHoareTripleChecker+Valid, 5037 SdHoareTripleChecker+Invalid, 6969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:43,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5734 Valid, 5037 Invalid, 6969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-23 04:27:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2022-07-23 04:27:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 10548. [2022-07-23 04:27:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 6974 states have (on average 1.273157441927158) internal successors, (8879), 7225 states have internal predecessors, (8879), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-23 04:27:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14872 transitions. [2022-07-23 04:27:43,908 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14872 transitions. Word has length 108 [2022-07-23 04:27:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:43,908 INFO L495 AbstractCegarLoop]: Abstraction has 10548 states and 14872 transitions. [2022-07-23 04:27:43,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:27:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14872 transitions. [2022-07-23 04:27:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-23 04:27:43,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:43,911 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 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] [2022-07-23 04:27:43,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:27:43,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_usb_register_check_return_value_probeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2105982114, now seen corresponding path program 1 times [2022-07-23 04:27:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400485167] [2022-07-23 04:27:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:27:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:27:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:27:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:27:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:27:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 04:27:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:27:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:27:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-23 04:27:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400485167] [2022-07-23 04:27:44,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400485167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:27:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049087388] [2022-07-23 04:27:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:27:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:27:44,163 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-23 04:27:44,188 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-23 04:27:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:45,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 04:27:45,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:27:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-23 04:27:45,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:27:45,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049087388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:45,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:27:45,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-23 04:27:45,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79264584] [2022-07-23 04:27:45,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:45,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:27:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:27:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:27:45,214 INFO L87 Difference]: Start difference. First operand 10548 states and 14872 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:27:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:45,799 INFO L93 Difference]: Finished difference Result 21069 states and 29712 transitions. [2022-07-23 04:27:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:27:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 122 [2022-07-23 04:27:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:45,834 INFO L225 Difference]: With dead ends: 21069 [2022-07-23 04:27:45,834 INFO L226 Difference]: Without dead ends: 10542 [2022-07-23 04:27:45,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:27:45,868 INFO L413 NwaCegarLoop]: 3550 mSDtfsCounter, 3530 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3530 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:45,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3530 Valid, 3550 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:27:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2022-07-23 04:27:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10542. [2022-07-23 04:27:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10542 states, 6969 states have (on average 1.2727794518582294) internal successors, (8870), 7219 states have internal predecessors, (8870), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-23 04:27:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 14863 transitions. [2022-07-23 04:27:46,346 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 14863 transitions. Word has length 122 [2022-07-23 04:27:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:46,347 INFO L495 AbstractCegarLoop]: Abstraction has 10542 states and 14863 transitions. [2022-07-23 04:27:46,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:27:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 14863 transitions. [2022-07-23 04:27:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 04:27:46,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:46,351 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:27:46,384 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-23 04:27:46,579 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,SelfDestructingSolverStorable13 [2022-07-23 04:27:46,580 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2455789, now seen corresponding path program 1 times [2022-07-23 04:27:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:46,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485253456] [2022-07-23 04:27:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:27:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:27:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:27:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:27:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:27:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:27:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485253456] [2022-07-23 04:27:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485253456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:46,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740891647] [2022-07-23 04:27:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:46,834 INFO L87 Difference]: Start difference. First operand 10542 states and 14863 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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-23 04:27:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:52,962 INFO L93 Difference]: Finished difference Result 10542 states and 14863 transitions. [2022-07-23 04:27:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 110 [2022-07-23 04:27:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:53,006 INFO L225 Difference]: With dead ends: 10542 [2022-07-23 04:27:53,006 INFO L226 Difference]: Without dead ends: 10540 [2022-07-23 04:27:53,014 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-23 04:27:53,015 INFO L413 NwaCegarLoop]: 3075 mSDtfsCounter, 5491 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 6965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:53,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 5031 Invalid, 6965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-23 04:27:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2022-07-23 04:27:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 10540. [2022-07-23 04:27:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10540 states, 6968 states have (on average 1.272675086107922) internal successors, (8868), 7217 states have internal predecessors, (8868), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-23 04:27:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 14861 transitions. [2022-07-23 04:27:53,544 INFO L78 Accepts]: Start accepts. Automaton has 10540 states and 14861 transitions. Word has length 110 [2022-07-23 04:27:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:27:53,545 INFO L495 AbstractCegarLoop]: Abstraction has 10540 states and 14861 transitions. [2022-07-23 04:27:53,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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-23 04:27:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 10540 states and 14861 transitions. [2022-07-23 04:27:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-23 04:27:53,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:27:53,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:27:53,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:27:53,548 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:27:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:27:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1227318538, now seen corresponding path program 1 times [2022-07-23 04:27:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:27:53,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322292833] [2022-07-23 04:27:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:27:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:27:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:27:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:27:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:27:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:27:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:27:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:27:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:27:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:27:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:27:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:27:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:27:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:27:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:27:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:27:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:27:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:27:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:27:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:27:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:27:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:27:53,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322292833] [2022-07-23 04:27:53,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322292833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:27:53,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:27:53,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:27:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893849026] [2022-07-23 04:27:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:27:53,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:27:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:27:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:27:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:27:53,792 INFO L87 Difference]: Start difference. First operand 10540 states and 14861 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-23 04:27:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:27:59,861 INFO L93 Difference]: Finished difference Result 10540 states and 14861 transitions. [2022-07-23 04:27:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:27:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 116 [2022-07-23 04:27:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:27:59,889 INFO L225 Difference]: With dead ends: 10540 [2022-07-23 04:27:59,889 INFO L226 Difference]: Without dead ends: 10538 [2022-07-23 04:27:59,893 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-23 04:27:59,893 INFO L413 NwaCegarLoop]: 3073 mSDtfsCounter, 5487 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5702 SdHoareTripleChecker+Valid, 5029 SdHoareTripleChecker+Invalid, 6963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:27:59,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5702 Valid, 5029 Invalid, 6963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-23 04:27:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2022-07-23 04:28:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 10538. [2022-07-23 04:28:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10538 states, 6967 states have (on average 1.2725706903975886) internal successors, (8866), 7215 states have internal predecessors, (8866), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-23 04:28:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10538 states to 10538 states and 14859 transitions. [2022-07-23 04:28:00,318 INFO L78 Accepts]: Start accepts. Automaton has 10538 states and 14859 transitions. Word has length 116 [2022-07-23 04:28:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:00,319 INFO L495 AbstractCegarLoop]: Abstraction has 10538 states and 14859 transitions. [2022-07-23 04:28:00,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-23 04:28:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 10538 states and 14859 transitions. [2022-07-23 04:28:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-23 04:28:00,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:00,322 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-23 04:28:00,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:28:00,322 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1970825439, now seen corresponding path program 1 times [2022-07-23 04:28:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909472412] [2022-07-23 04:28:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:28:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:28:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 04:28:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 04:28:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:28:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 04:28:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:28:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-23 04:28:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909472412] [2022-07-23 04:28:00,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909472412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:28:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630635201] [2022-07-23 04:28:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:28:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:28:00,795 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-23 04:28:00,797 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-23 04:28:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:01,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 04:28:01,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:28:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 04:28:01,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:28:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630635201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:01,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:28:01,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 19 [2022-07-23 04:28:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176108557] [2022-07-23 04:28:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:01,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 04:28:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 04:28:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:28:01,770 INFO L87 Difference]: Start difference. First operand 10538 states and 14859 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-23 04:28:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:02,805 INFO L93 Difference]: Finished difference Result 20562 states and 28906 transitions. [2022-07-23 04:28:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:28:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 135 [2022-07-23 04:28:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:02,847 INFO L225 Difference]: With dead ends: 20562 [2022-07-23 04:28:02,847 INFO L226 Difference]: Without dead ends: 10591 [2022-07-23 04:28:02,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-07-23 04:28:02,890 INFO L413 NwaCegarLoop]: 3530 mSDtfsCounter, 45 mSDsluCounter, 42095 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 45625 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:02,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 45625 Invalid, 797 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [171 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:28:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2022-07-23 04:28:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10562. [2022-07-23 04:28:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 6983 states have (on average 1.2719461549477302) internal successors, (8882), 7231 states have internal predecessors, (8882), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 14891 transitions. [2022-07-23 04:28:03,354 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 14891 transitions. Word has length 135 [2022-07-23 04:28:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:03,354 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 14891 transitions. [2022-07-23 04:28:03,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-23 04:28:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 14891 transitions. [2022-07-23 04:28:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-23 04:28:03,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:03,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:03,384 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-23 04:28:03,571 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,SelfDestructingSolverStorable16 [2022-07-23 04:28:03,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1099724524, now seen corresponding path program 1 times [2022-07-23 04:28:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:03,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931322952] [2022-07-23 04:28:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931322952] [2022-07-23 04:28:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931322952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:03,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:03,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021241686] [2022-07-23 04:28:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:03,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:03,842 INFO L87 Difference]: Start difference. First operand 10562 states and 14891 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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-23 04:28:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:09,817 INFO L93 Difference]: Finished difference Result 10562 states and 14891 transitions. [2022-07-23 04:28:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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 122 [2022-07-23 04:28:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:09,852 INFO L225 Difference]: With dead ends: 10562 [2022-07-23 04:28:09,852 INFO L226 Difference]: Without dead ends: 10560 [2022-07-23 04:28:09,858 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-23 04:28:09,858 INFO L413 NwaCegarLoop]: 3071 mSDtfsCounter, 5481 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5695 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 6961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:09,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5695 Valid, 5027 Invalid, 6961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 04:28:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-23 04:28:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 10560. [2022-07-23 04:28:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 6982 states have (on average 1.2718418791177313) internal successors, (8880), 7229 states have internal predecessors, (8880), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-23 04:28:10,377 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 122 [2022-07-23 04:28:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:10,377 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-23 04:28:10,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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-23 04:28:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-23 04:28:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-23 04:28:10,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:10,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:10,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:28:10,380 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash -894151915, now seen corresponding path program 1 times [2022-07-23 04:28:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55446703] [2022-07-23 04:28:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:10,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:10,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55446703] [2022-07-23 04:28:10,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55446703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:10,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:10,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534339817] [2022-07-23 04:28:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:10,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:10,620 INFO L87 Difference]: Start difference. First operand 10560 states and 14889 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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-23 04:28:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:16,486 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-23 04:28:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:16,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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 128 [2022-07-23 04:28:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:16,521 INFO L225 Difference]: With dead ends: 10560 [2022-07-23 04:28:16,521 INFO L226 Difference]: Without dead ends: 10558 [2022-07-23 04:28:16,528 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-23 04:28:16,529 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 5475 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5688 SdHoareTripleChecker+Valid, 5025 SdHoareTripleChecker+Invalid, 6959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:16,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5688 Valid, 5025 Invalid, 6959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-23 04:28:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-23 04:28:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-23 04:28:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10558 states, 6981 states have (on average 1.271737573413551) internal successors, (8878), 7227 states have internal predecessors, (8878), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-23 04:28:17,010 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 128 [2022-07-23 04:28:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:17,010 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-23 04:28:17,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 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-23 04:28:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-23 04:28:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-23 04:28:17,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:17,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:17,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:28:17,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 150555854, now seen corresponding path program 1 times [2022-07-23 04:28:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:17,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498664246] [2022-07-23 04:28:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:28:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:17,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498664246] [2022-07-23 04:28:17,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498664246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:17,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:17,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782835366] [2022-07-23 04:28:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:17,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:17,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:17,260 INFO L87 Difference]: Start difference. First operand 10558 states and 14887 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-23 04:28:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:23,480 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-23 04:28:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:23,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 134 [2022-07-23 04:28:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:23,514 INFO L225 Difference]: With dead ends: 10558 [2022-07-23 04:28:23,515 INFO L226 Difference]: Without dead ends: 10556 [2022-07-23 04:28:23,522 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-23 04:28:23,522 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 5469 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5681 SdHoareTripleChecker+Valid, 5023 SdHoareTripleChecker+Invalid, 6957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:23,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5681 Valid, 5023 Invalid, 6957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-23 04:28:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-23 04:28:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-23 04:28:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 6980 states have (on average 1.2716332378223496) internal successors, (8876), 7225 states have internal predecessors, (8876), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-23 04:28:23,996 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 134 [2022-07-23 04:28:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:23,997 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-23 04:28:23,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-23 04:28:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-23 04:28:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-23 04:28:24,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:24,004 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:28:24,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:28:24,004 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash -931896786, now seen corresponding path program 1 times [2022-07-23 04:28:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:24,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472788929] [2022-07-23 04:28:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:24,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-23 04:28:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:28:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:28:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:28:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:28:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:28:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:28:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-23 04:28:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 04:28:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:28:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:28:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:28:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:28:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:28:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-23 04:28:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472788929] [2022-07-23 04:28:24,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472788929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:28:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919981734] [2022-07-23 04:28:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:28:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:28:24,348 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-23 04:28:24,353 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-23 04:28:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:25,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 04:28:25,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:28:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 04:28:25,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:28:25,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919981734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:25,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:28:25,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 12 [2022-07-23 04:28:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104478277] [2022-07-23 04:28:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:25,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:28:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:28:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:28:25,291 INFO L87 Difference]: Start difference. First operand 10556 states and 14885 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:28:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:26,108 INFO L93 Difference]: Finished difference Result 21742 states and 30764 transitions. [2022-07-23 04:28:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:28:26,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-23 04:28:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:26,160 INFO L225 Difference]: With dead ends: 21742 [2022-07-23 04:28:26,161 INFO L226 Difference]: Without dead ends: 11376 [2022-07-23 04:28:26,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:28:26,207 INFO L413 NwaCegarLoop]: 3928 mSDtfsCounter, 401 mSDsluCounter, 26985 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 30913 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:26,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 30913 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 04:28:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11376 states. [2022-07-23 04:28:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11376 to 10560. [2022-07-23 04:28:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 6984 states have (on average 1.2714776632302405) internal successors, (8880), 7229 states have internal predecessors, (8880), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-23 04:28:26,729 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 151 [2022-07-23 04:28:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:26,729 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-23 04:28:26,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:28:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-23 04:28:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-23 04:28:26,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:26,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:26,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 04:28:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:28:26,932 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2137124343, now seen corresponding path program 1 times [2022-07-23 04:28:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275773190] [2022-07-23 04:28:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:28:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:28:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:27,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275773190] [2022-07-23 04:28:27,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275773190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:27,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:27,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030658242] [2022-07-23 04:28:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:27,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:27,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:27,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:27,262 INFO L87 Difference]: Start difference. First operand 10560 states and 14889 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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-23 04:28:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:33,406 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-23 04:28:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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 140 [2022-07-23 04:28:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:33,446 INFO L225 Difference]: With dead ends: 10560 [2022-07-23 04:28:33,446 INFO L226 Difference]: Without dead ends: 10558 [2022-07-23 04:28:33,454 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-23 04:28:33,455 INFO L413 NwaCegarLoop]: 3065 mSDtfsCounter, 5463 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5674 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 6955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:33,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5674 Valid, 5021 Invalid, 6955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-23 04:28:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-23 04:28:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-23 04:28:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10558 states, 6983 states have (on average 1.2713733352427323) internal successors, (8878), 7227 states have internal predecessors, (8878), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-23 04:28:34,021 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 140 [2022-07-23 04:28:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:34,021 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-23 04:28:34,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 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-23 04:28:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-23 04:28:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-23 04:28:34,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:34,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:28:34,023 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -938020630, now seen corresponding path program 1 times [2022-07-23 04:28:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467701498] [2022-07-23 04:28:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:28:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:28:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:28:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467701498] [2022-07-23 04:28:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467701498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:34,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387157475] [2022-07-23 04:28:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:34,296 INFO L87 Difference]: Start difference. First operand 10558 states and 14887 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-23 04:28:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:40,473 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-23 04:28:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 146 [2022-07-23 04:28:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:40,503 INFO L225 Difference]: With dead ends: 10558 [2022-07-23 04:28:40,503 INFO L226 Difference]: Without dead ends: 10556 [2022-07-23 04:28:40,507 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-23 04:28:40,508 INFO L413 NwaCegarLoop]: 3063 mSDtfsCounter, 5457 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5667 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 6953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:40,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5667 Valid, 5019 Invalid, 6953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-23 04:28:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-23 04:28:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-23 04:28:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 6982 states have (on average 1.271268977370381) internal successors, (8876), 7225 states have internal predecessors, (8876), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-23 04:28:40,997 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 146 [2022-07-23 04:28:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:40,997 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-23 04:28:40,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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-23 04:28:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-23 04:28:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 04:28:40,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:40,999 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:28:40,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:28:41,000 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1073850845, now seen corresponding path program 1 times [2022-07-23 04:28:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:41,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550529671] [2022-07-23 04:28:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:28:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:28:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:28:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:28:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:28:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:28:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:28:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:28:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:28:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:28:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:28:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:28:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:28:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:28:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:28:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:28:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:28:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:28:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:41,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550529671] [2022-07-23 04:28:41,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550529671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:41,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:41,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:28:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912071832] [2022-07-23 04:28:41,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:28:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:41,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:28:41,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:28:41,264 INFO L87 Difference]: Start difference. First operand 10556 states and 14885 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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-23 04:28:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:28:47,299 INFO L93 Difference]: Finished difference Result 10556 states and 14885 transitions. [2022-07-23 04:28:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:28:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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 152 [2022-07-23 04:28:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:28:47,331 INFO L225 Difference]: With dead ends: 10556 [2022-07-23 04:28:47,332 INFO L226 Difference]: Without dead ends: 10554 [2022-07-23 04:28:47,338 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-23 04:28:47,339 INFO L413 NwaCegarLoop]: 3061 mSDtfsCounter, 5451 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5660 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 6951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:28:47,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5660 Valid, 5017 Invalid, 6951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 04:28:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2022-07-23 04:28:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10554. [2022-07-23 04:28:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10554 states, 6981 states have (on average 1.2711645896003438) internal successors, (8874), 7223 states have internal predecessors, (8874), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-23 04:28:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 14883 transitions. [2022-07-23 04:28:47,848 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 14883 transitions. Word has length 152 [2022-07-23 04:28:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:28:47,848 INFO L495 AbstractCegarLoop]: Abstraction has 10554 states and 14883 transitions. [2022-07-23 04:28:47,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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-23 04:28:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 14883 transitions. [2022-07-23 04:28:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-23 04:28:47,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:28:47,854 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 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] [2022-07-23 04:28:47,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:28:47,854 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:28:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:28:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash -242444843, now seen corresponding path program 1 times [2022-07-23 04:28:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:28:47,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971689473] [2022-07-23 04:28:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:28:47,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:28:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:28:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:28:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:28:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:28:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:28:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:28:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:28:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:28:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:28:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:28:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:28:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:28:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:28:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:28:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:28:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:28:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:28:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 04:28:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:28:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-23 04:28:48,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:28:48,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971689473] [2022-07-23 04:28:48,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971689473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:28:48,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:28:48,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:28:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544606436] [2022-07-23 04:28:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:28:48,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:28:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:28:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:28:48,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:28:48,250 INFO L87 Difference]: Start difference. First operand 10554 states and 14883 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:29:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:01,221 INFO L93 Difference]: Finished difference Result 22631 states and 33041 transitions. [2022-07-23 04:29:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:29:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 176 [2022-07-23 04:29:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:01,269 INFO L225 Difference]: With dead ends: 22631 [2022-07-23 04:29:01,269 INFO L226 Difference]: Without dead ends: 12102 [2022-07-23 04:29:01,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:29:01,300 INFO L413 NwaCegarLoop]: 2957 mSDtfsCounter, 4582 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 9991 mSolverCounterSat, 4160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 14151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4160 IncrementalHoareTripleChecker+Valid, 9991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:01,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 6754 Invalid, 14151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4160 Valid, 9991 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-23 04:29:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2022-07-23 04:29:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 10838. [2022-07-23 04:29:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10838 states, 7185 states have (on average 1.2707028531663187) internal successors, (9130), 7439 states have internal predecessors, (9130), 2906 states have call successors, (2906), 711 states have call predecessors, (2906), 737 states have return successors, (3545), 2820 states have call predecessors, (3545), 2904 states have call successors, (3545) [2022-07-23 04:29:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 15581 transitions. [2022-07-23 04:29:01,902 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 15581 transitions. Word has length 176 [2022-07-23 04:29:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:01,903 INFO L495 AbstractCegarLoop]: Abstraction has 10838 states and 15581 transitions. [2022-07-23 04:29:01,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:29:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 15581 transitions. [2022-07-23 04:29:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-23 04:29:01,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:01,905 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 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] [2022-07-23 04:29:01,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:29:01,905 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:29:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 573026121, now seen corresponding path program 1 times [2022-07-23 04:29:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:01,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228184924] [2022-07-23 04:29:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:29:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:29:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:29:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:29:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:29:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:29:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:29:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:29:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:29:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:29:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:29:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 04:29:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:29:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 04:29:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:29:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-23 04:29:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228184924] [2022-07-23 04:29:02,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228184924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:02,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:02,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:29:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57673371] [2022-07-23 04:29:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:29:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:29:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:29:02,243 INFO L87 Difference]: Start difference. First operand 10838 states and 15581 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:29:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:29:14,350 INFO L93 Difference]: Finished difference Result 23099 states and 34027 transitions. [2022-07-23 04:29:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:29:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 177 [2022-07-23 04:29:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:29:14,391 INFO L225 Difference]: With dead ends: 23099 [2022-07-23 04:29:14,391 INFO L226 Difference]: Without dead ends: 12286 [2022-07-23 04:29:14,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:29:14,422 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 4579 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 10017 mSolverCounterSat, 4155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 14172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4155 IncrementalHoareTripleChecker+Valid, 10017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:29:14,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 6755 Invalid, 14172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4155 Valid, 10017 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-07-23 04:29:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2022-07-23 04:29:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 11030. [2022-07-23 04:29:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11030 states, 7337 states have (on average 1.2716369088183181) internal successors, (9330), 7591 states have internal predecessors, (9330), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-23 04:29:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 15865 transitions. [2022-07-23 04:29:15,035 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 15865 transitions. Word has length 177 [2022-07-23 04:29:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:29:15,035 INFO L495 AbstractCegarLoop]: Abstraction has 11030 states and 15865 transitions. [2022-07-23 04:29:15,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-23 04:29:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 15865 transitions. [2022-07-23 04:29:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-23 04:29:15,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:29:15,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:29:15,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:29:15,038 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-23 04:29:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:29:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -574680277, now seen corresponding path program 1 times [2022-07-23 04:29:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:29:15,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19178101] [2022-07-23 04:29:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:29:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:29:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:29:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:29:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:29:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-23 04:29:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 04:29:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:29:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:29:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:29:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-23 04:29:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:29:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-23 04:29:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:29:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:29:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:29:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:29:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 04:29:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-23 04:29:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 04:29:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:29:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:29:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:29:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:29:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:29:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:29:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:29:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-23 04:29:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:29:15,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19178101] [2022-07-23 04:29:15,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19178101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:29:15,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:29:15,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:29:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225848921] [2022-07-23 04:29:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:29:15,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:29:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:29:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:29:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:29:15,332 INFO L87 Difference]: Start difference. First operand 11030 states and 15865 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 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)