./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-20 04:11:12,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:11:12,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:11:12,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:11:12,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:11:12,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:11:12,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:11:12,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:11:12,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:11:12,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:11:12,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:11:12,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:11:12,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:11:12,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:11:12,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:11:12,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:11:12,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:11:12,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:11:12,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:11:12,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:11:12,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:11:12,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:11:12,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:11:12,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:11:12,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:11:12,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:11:12,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:11:12,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:11:12,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:11:12,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:11:12,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:11:12,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:11:12,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:11:12,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:11:12,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:11:12,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:11:12,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:11:12,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:11:12,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:11:12,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:11:12,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:11:12,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:11:12,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:11:12,749 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:11:12,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:11:12,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:11:12,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:11:12,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:11:12,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:11:12,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:11:12,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:11:12,752 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:11:12,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:11:12,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:11:12,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:11:12,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:11:12,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:11:12,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:11:12,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:11:12,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:11:12,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:11:12,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:11:12,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:11:12,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:11:12,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:11:12,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:11:12,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:11:12,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:11:12,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:11:12,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:11:12,757 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:11:12,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:11:12,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:11:12,758 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-20 04:11:13,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:11:13,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:11:13,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:11:13,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:11:13,075 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:11:13,076 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-20 04:11:13,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281cdd6e/052e5f5806844b559a339ec4970f6fda/FLAGea570af29 [2022-07-20 04:11:13,993 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:11:13,993 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-20 04:11:14,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281cdd6e/052e5f5806844b559a339ec4970f6fda/FLAGea570af29 [2022-07-20 04:11:14,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b281cdd6e/052e5f5806844b559a339ec4970f6fda [2022-07-20 04:11:14,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:11:14,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:11:14,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:11:14,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:11:14,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:11:14,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:14" (1/1) ... [2022-07-20 04:11:14,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d899451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:14, skipping insertion in model container [2022-07-20 04:11:14,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:11:14" (1/1) ... [2022-07-20 04:11:14,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:11:14,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:11:17,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-20 04:11:17,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-20 04:11:17,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-20 04:11:17,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-20 04:11:17,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-20 04:11:17,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-20 04:11:17,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-20 04:11:17,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-20 04:11:17,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-20 04:11:17,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-20 04:11:17,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-20 04:11:17,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-20 04:11:17,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-20 04:11:17,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-20 04:11:17,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-20 04:11:17,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-20 04:11:17,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-20 04:11:17,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-20 04:11:17,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-20 04:11:17,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-20 04:11:17,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-20 04:11:17,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-20 04:11:17,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-20 04:11:17,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-20 04:11:17,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,963 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:17,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:11:18,010 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:11:18,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:11:18,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:11:18,647 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:11:18,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18 WrapperNode [2022-07-20 04:11:18,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:11:18,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:11:18,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:11:18,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:11:18,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:18,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,131 INFO L137 Inliner]: procedures = 640, calls = 2778, calls flagged for inlining = 295, calls inlined = 219, statements flattened = 6490 [2022-07-20 04:11:19,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:11:19,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:11:19,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:11:19,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:11:19,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:11:19,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:11:19,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:11:19,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:11:19,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (1/1) ... [2022-07-20 04:11:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:11:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:11:19,801 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-20 04:11:19,825 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-20 04:11:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 04:11:19,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 04:11:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:11:19,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:11:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:11:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:11:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_wakeup [2022-07-20 04:11:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_wakeup [2022-07-20 04:11:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read_fifo [2022-07-20 04:11:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read_fifo [2022-07-20 04:11:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write_fifo [2022-07-20 04:11:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write_fifo [2022-07-20 04:11:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:11:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:11:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-20 04:11:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-20 04:11:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-20 04:11:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-20 04:11:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:11:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:11:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-20 04:11:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-20 04:11:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:11:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:11:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read [2022-07-20 04:11:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read [2022-07-20 04:11:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-20 04:11:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-20 04:11:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_enable [2022-07-20 04:11:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_enable [2022-07-20 04:11:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pio_advance [2022-07-20 04:11:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pio_advance [2022-07-20 04:11:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:11:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:11:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:11:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:11:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure set_fifo_bytecount [2022-07-20 04:11:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure set_fifo_bytecount [2022-07-20 04:11:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reset [2022-07-20 04:11:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reset [2022-07-20 04:11:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:11:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:11:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:11:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:11:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:11:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:11:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reinit [2022-07-20 04:11:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reinit [2022-07-20 04:11:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_unregister [2022-07-20 04:11:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_unregister [2022-07-20 04:11:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-20 04:11:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-20 04:11:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:11:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_101 [2022-07-20 04:11:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_101 [2022-07-20 04:11:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure type_string [2022-07-20 04:11:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure type_string [2022-07-20 04:11:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_gadget_release [2022-07-20 04:11:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_gadget_release [2022-07-20 04:11:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:11:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:11:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_dma [2022-07-20 04:11:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_dma [2022-07-20 04:11:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure allow_status [2022-07-20 04:11:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure allow_status [2022-07-20 04:11:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-20 04:11:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-20 04:11:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:11:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:11:19,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:11:19,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:11:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_request_dma [2022-07-20 04:11:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_request_dma [2022-07-20 04:11:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:11:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:11:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:11:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:11:19,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:11:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:11:19,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:11:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 04:11:19,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 04:11:19,858 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_read [2022-07-20 04:11:19,858 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_read [2022-07-20 04:11:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-20 04:11:19,859 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-20 04:11:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:11:19,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:11:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 04:11:19,859 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 04:11:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:11:19,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:11:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_check_return_value_probe [2022-07-20 04:11:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_check_return_value_probe [2022-07-20 04:11:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_halt_and_wedge [2022-07-20 04:11:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_halt_and_wedge [2022-07-20 04:11:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:11:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-20 04:11:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-20 04:11:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-20 04:11:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-20 04:11:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:11:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:11:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:11:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-20 04:11:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-20 04:11:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:11:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:11:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:11:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:11:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:11:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure set_halt [2022-07-20 04:11:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_halt [2022-07-20 04:11:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ep_set_maxpacket_limit [2022-07-20 04:11:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ep_set_maxpacket_limit [2022-07-20 04:11:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:11:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:11:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-20 04:11:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-20 04:11:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_wedge [2022-07-20 04:11:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_wedge [2022-07-20 04:11:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_reset [2022-07-20 04:11:19,864 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_reset [2022-07-20 04:11:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-20 04:11:19,864 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-20 04:11:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-20 04:11:19,864 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-20 04:11:19,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:11:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:11:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure stop_activity [2022-07-20 04:11:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_activity [2022-07-20 04:11:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 04:11:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 04:11:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:11:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:11:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_irq [2022-07-20 04:11:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_irq [2022-07-20 04:11:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_ep [2022-07-20 04:11:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_ep [2022-07-20 04:11:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_start [2022-07-20 04:11:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_start [2022-07-20 04:11:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_write [2022-07-20 04:11:19,866 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_write [2022-07-20 04:11:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_probe [2022-07-20 04:11:19,867 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_probe [2022-07-20 04:11:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:11:19,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:11:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_fin [2022-07-20 04:11:19,867 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_fin [2022-07-20 04:11:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_flush [2022-07-20 04:11:19,867 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_flush [2022-07-20 04:11:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_done [2022-07-20 04:11:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_done [2022-07-20 04:11:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_cancel_dma [2022-07-20 04:11:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_cancel_dma [2022-07-20 04:11:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:11:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-20 04:11:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue_all [2022-07-20 04:11:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue_all [2022-07-20 04:11:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_post_probe [2022-07-20 04:11:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_post_probe [2022-07-20 04:11:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_init [2022-07-20 04:11:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_init [2022-07-20 04:11:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:11:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:11:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-20 04:11:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-20 04:11:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_remove [2022-07-20 04:11:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_remove [2022-07-20 04:11:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:11:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:11:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:11:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 04:11:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 04:11:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:11:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:11:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_status [2022-07-20 04:11:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_status [2022-07-20 04:11:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:11:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq_130 [2022-07-20 04:11:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq_130 [2022-07-20 04:11:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_isoc [2022-07-20 04:11:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_isoc [2022-07-20 04:11:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure buf_state_string [2022-07-20 04:11:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure buf_state_string [2022-07-20 04:11:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure clear_halt [2022-07-20 04:11:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_halt [2022-07-20 04:11:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-20 04:11:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-20 04:11:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_stop [2022-07-20 04:11:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_stop [2022-07-20 04:11:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:11:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:11:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 04:11:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2022-07-20 04:11:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pre_probe [2022-07-20 04:11:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_reg_addr [2022-07-20 04:11:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_reg_addr [2022-07-20 04:11:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-20 04:11:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-20 04:11:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 04:11:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 04:11:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_probe [2022-07-20 04:11:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_probe [2022-07-20 04:11:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:11:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:11:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-20 04:11:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-20 04:11:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_irq_register_11_2 [2022-07-20 04:11:19,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_irq_register_11_2 [2022-07-20 04:11:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:11:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:11:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write [2022-07-20 04:11:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write [2022-07-20 04:11:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-20 04:11:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-20 04:11:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:11:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_remove [2022-07-20 04:11:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_remove [2022-07-20 04:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-20 04:11:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-20 04:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep0_start [2022-07-20 04:11:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep0_start [2022-07-20 04:11:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:11:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:11:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:11:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_remove [2022-07-20 04:11:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_remove [2022-07-20 04:11:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_disable [2022-07-20 04:11:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_disable [2022-07-20 04:11:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:11:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:11:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-20 04:11:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-20 04:11:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:11:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:11:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:11:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_stat0_irqs [2022-07-20 04:11:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_stat0_irqs [2022-07-20 04:11:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:11:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:11:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:11:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:11:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_frame [2022-07-20 04:11:19,880 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_frame [2022-07-20 04:11:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:11:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:11:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_102 [2022-07-20 04:11:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_102 [2022-07-20 04:11:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_ep_by_addr [2022-07-20 04:11:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_ep_by_addr [2022-07-20 04:11:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-20 04:11:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-20 04:11:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:11:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:11:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:11:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:11:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_instance_handler_0_5 [2022-07-20 04:11:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_instance_handler_0_5 [2022-07-20 04:11:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-20 04:11:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-20 04:11:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_kick_dma [2022-07-20 04:11:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_kick_dma [2022-07-20 04:11:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue [2022-07-20 04:11:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue [2022-07-20 04:11:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-20 04:11:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-20 04:11:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-20 04:11:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-20 04:11:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:11:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-07-20 04:11:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-07-20 04:11:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-20 04:11:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-20 04:11:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-20 04:11:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-20 04:11:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-20 04:11:19,884 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-20 04:11:20,636 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:11:20,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:11:20,972 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:11:21,254 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 04:11:21,399 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-20 04:11:21,399 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-20 04:11:21,399 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-20 04:11:21,400 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-20 04:11:21,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: goto; [2022-07-20 04:11:21,400 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-20 04:11:21,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !(0 != assert_out_naking_~tmp___0~4#1); [2022-07-20 04:11:21,401 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-20 04:11:21,401 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-20 04:11:25,137 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:11:25,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:11:25,156 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 04:11:25,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:25 BoogieIcfgContainer [2022-07-20 04:11:25,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:11:25,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:11:25,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:11:25,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:11:25,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:11:14" (1/3) ... [2022-07-20 04:11:25,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6751205c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:25, skipping insertion in model container [2022-07-20 04:11:25,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:11:18" (2/3) ... [2022-07-20 04:11:25,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6751205c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:11:25, skipping insertion in model container [2022-07-20 04:11:25,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:11:25" (3/3) ... [2022-07-20 04:11:25,173 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-20 04:11:25,187 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:11:25,187 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-20 04:11:25,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:11:25,297 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@e695d8c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ca2ccaa [2022-07-20 04:11:25,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-20 04:11:25,309 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-20 04:11:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 04:11:25,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:25,325 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-20 04:11:25,325 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-20 04:11:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1907190920, now seen corresponding path program 1 times [2022-07-20 04:11:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:25,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126500553] [2022-07-20 04:11:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:11:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:11:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:11:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:11:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:26,142 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-20 04:11:26,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126500553] [2022-07-20 04:11:26,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126500553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189881389] [2022-07-20 04:11:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:26,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:26,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:26,192 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-20 04:11:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:39,269 INFO L93 Difference]: Finished difference Result 7591 states and 11348 transitions. [2022-07-20 04:11:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:11:39,272 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-20 04:11:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:39,325 INFO L225 Difference]: With dead ends: 7591 [2022-07-20 04:11:39,325 INFO L226 Difference]: Without dead ends: 5012 [2022-07-20 04:11:39,349 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-20 04:11:39,352 INFO L413 NwaCegarLoop]: 3512 mSDtfsCounter, 8537 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 8327 mSolverCounterSat, 5582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8731 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 13909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5582 IncrementalHoareTripleChecker+Valid, 8327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:39,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8731 Valid, 6479 Invalid, 13909 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5582 Valid, 8327 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2022-07-20 04:11:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2022-07-20 04:11:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4815. [2022-07-20 04:11:39,774 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-20 04:11:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 6885 transitions. [2022-07-20 04:11:39,818 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 6885 transitions. Word has length 66 [2022-07-20 04:11:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:39,819 INFO L495 AbstractCegarLoop]: Abstraction has 4815 states and 6885 transitions. [2022-07-20 04:11:39,820 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-20 04:11:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 6885 transitions. [2022-07-20 04:11:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 04:11:39,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:39,830 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-20 04:11:39,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:11:39,831 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-20 04:11:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 259434772, now seen corresponding path program 1 times [2022-07-20 04:11:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:39,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050110714] [2022-07-20 04:11:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:11:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:11:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:11:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:11:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:11:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:11:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:40,247 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-20 04:11:40,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050110714] [2022-07-20 04:11:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050110714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:40,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:40,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935847456] [2022-07-20 04:11:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:40,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:40,251 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-20 04:11:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:46,715 INFO L93 Difference]: Finished difference Result 4815 states and 6885 transitions. [2022-07-20 04:11:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:46,716 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-20 04:11:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:46,746 INFO L225 Difference]: With dead ends: 4815 [2022-07-20 04:11:46,747 INFO L226 Difference]: Without dead ends: 4813 [2022-07-20 04:11:46,751 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-20 04:11:46,752 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-20 04:11:46,752 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-20 04:11:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2022-07-20 04:11:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4813. [2022-07-20 04:11:46,963 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-20 04:11:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6883 transitions. [2022-07-20 04:11:46,993 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6883 transitions. Word has length 72 [2022-07-20 04:11:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6883 transitions. [2022-07-20 04:11:46,995 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-20 04:11:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6883 transitions. [2022-07-20 04:11:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-20 04:11:46,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:46,998 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-20 04:11:46,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:11:46,998 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-20 04:11:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -458841926, now seen corresponding path program 1 times [2022-07-20 04:11:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119879661] [2022-07-20 04:11:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:11:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:11:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:11:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:11:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:11:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:11:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:11:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:47,331 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-20 04:11:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:47,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119879661] [2022-07-20 04:11:47,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119879661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:47,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:47,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624559012] [2022-07-20 04:11:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:47,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:47,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:47,335 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-20 04:11:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:52,859 INFO L93 Difference]: Finished difference Result 4813 states and 6883 transitions. [2022-07-20 04:11:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:52,860 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-20 04:11:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:52,888 INFO L225 Difference]: With dead ends: 4813 [2022-07-20 04:11:52,889 INFO L226 Difference]: Without dead ends: 4811 [2022-07-20 04:11:52,893 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-20 04:11:52,894 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5574 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:52,894 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.2s Time] [2022-07-20 04:11:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2022-07-20 04:11:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4811. [2022-07-20 04:11:53,099 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-20 04:11:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6881 transitions. [2022-07-20 04:11:53,126 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6881 transitions. Word has length 78 [2022-07-20 04:11:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:53,127 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6881 transitions. [2022-07-20 04:11:53,128 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-20 04:11:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6881 transitions. [2022-07-20 04:11:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 04:11:53,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:53,131 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-20 04:11:53,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:11:53,131 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-20 04:11:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash 134960499, now seen corresponding path program 1 times [2022-07-20 04:11:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:53,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374903836] [2022-07-20 04:11:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:11:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:11:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:11:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:11:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:11:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:11:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:11:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:11:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:53,436 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-20 04:11:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:53,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374903836] [2022-07-20 04:11:53,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374903836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:53,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:53,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030582969] [2022-07-20 04:11:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:53,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:53,440 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-20 04:11:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:11:58,807 INFO L93 Difference]: Finished difference Result 4811 states and 6881 transitions. [2022-07-20 04:11:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:11:58,808 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-20 04:11:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:11:58,831 INFO L225 Difference]: With dead ends: 4811 [2022-07-20 04:11:58,831 INFO L226 Difference]: Without dead ends: 4809 [2022-07-20 04:11:58,834 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-20 04:11:58,834 INFO L413 NwaCegarLoop]: 3098 mSDtfsCounter, 5568 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:11:58,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5788 Valid, 5054 Invalid, 6992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-20 04:11:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2022-07-20 04:11:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2022-07-20 04:11:59,004 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-20 04:11:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6879 transitions. [2022-07-20 04:11:59,028 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6879 transitions. Word has length 84 [2022-07-20 04:11:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:11:59,028 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6879 transitions. [2022-07-20 04:11:59,029 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-20 04:11:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6879 transitions. [2022-07-20 04:11:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-20 04:11:59,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:11:59,030 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-20 04:11:59,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:11:59,032 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-20 04:11:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:11:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1947085320, now seen corresponding path program 1 times [2022-07-20 04:11:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:11:59,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275670484] [2022-07-20 04:11:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:11:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:11:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:11:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:11:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:11:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:11:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:11:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:11:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:11:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:11:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:11:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:11:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:11:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:11:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:11:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:11:59,303 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-20 04:11:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:11:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275670484] [2022-07-20 04:11:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275670484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:11:59,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:11:59,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:11:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073453425] [2022-07-20 04:11:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:11:59,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:11:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:11:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:11:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:11:59,305 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-20 04:12:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:04,383 INFO L93 Difference]: Finished difference Result 4809 states and 6879 transitions. [2022-07-20 04:12:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:04,383 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-20 04:12:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:04,411 INFO L225 Difference]: With dead ends: 4809 [2022-07-20 04:12:04,411 INFO L226 Difference]: Without dead ends: 4807 [2022-07-20 04:12:04,414 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-20 04:12:04,415 INFO L413 NwaCegarLoop]: 3096 mSDtfsCounter, 5562 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:04,416 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.8s Time] [2022-07-20 04:12:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2022-07-20 04:12:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2022-07-20 04:12:04,616 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-20 04:12:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6877 transitions. [2022-07-20 04:12:04,646 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6877 transitions. Word has length 90 [2022-07-20 04:12:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:04,647 INFO L495 AbstractCegarLoop]: Abstraction has 4807 states and 6877 transitions. [2022-07-20 04:12:04,648 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-20 04:12:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6877 transitions. [2022-07-20 04:12:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:12:04,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:04,655 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-20 04:12:04,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:12:04,656 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-20 04:12:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash 674168724, now seen corresponding path program 1 times [2022-07-20 04:12:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303525645] [2022-07-20 04:12:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:12:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:12:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:12:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:12:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:12:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:12:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:12:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:05,059 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-20 04:12:05,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:05,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303525645] [2022-07-20 04:12:05,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303525645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:05,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:05,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:12:05,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122552563] [2022-07-20 04:12:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:05,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:12:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:12:05,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:12:05,063 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-20 04:12:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:18,979 INFO L93 Difference]: Finished difference Result 12257 states and 17686 transitions. [2022-07-20 04:12:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:12:18,979 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-20 04:12:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:19,036 INFO L225 Difference]: With dead ends: 12257 [2022-07-20 04:12:19,036 INFO L226 Difference]: Without dead ends: 7471 [2022-07-20 04:12:19,068 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-20 04:12:19,069 INFO L413 NwaCegarLoop]: 3215 mSDtfsCounter, 8990 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 14904 mSolverCounterSat, 6118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:19,069 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.2s Time] [2022-07-20 04:12:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-20 04:12:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7257. [2022-07-20 04:12:19,502 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-20 04:12:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 10327 transitions. [2022-07-20 04:12:19,541 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 10327 transitions. Word has length 120 [2022-07-20 04:12:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:19,542 INFO L495 AbstractCegarLoop]: Abstraction has 7257 states and 10327 transitions. [2022-07-20 04:12:19,542 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-20 04:12:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 10327 transitions. [2022-07-20 04:12:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 04:12:19,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:19,544 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-20 04:12:19,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:12:19,545 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-20 04:12:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash 674228306, now seen corresponding path program 1 times [2022-07-20 04:12:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:19,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448025349] [2022-07-20 04:12:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:12:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:12:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:12:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:12:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:12:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:12:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:12:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:19,880 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-20 04:12:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:19,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448025349] [2022-07-20 04:12:19,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448025349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:19,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:19,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:12:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331513239] [2022-07-20 04:12:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:19,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:12:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:12:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:12:19,882 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-20 04:12:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:28,218 INFO L93 Difference]: Finished difference Result 7487 states and 10683 transitions. [2022-07-20 04:12:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:12:28,218 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-20 04:12:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:28,258 INFO L225 Difference]: With dead ends: 7487 [2022-07-20 04:12:28,258 INFO L226 Difference]: Without dead ends: 7485 [2022-07-20 04:12:28,267 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-20 04:12:28,268 INFO L413 NwaCegarLoop]: 3112 mSDtfsCounter, 4433 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 7943 mSolverCounterSat, 3515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 6437 SdHoareTripleChecker+Invalid, 11458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3515 IncrementalHoareTripleChecker+Valid, 7943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:28,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 6437 Invalid, 11458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3515 Valid, 7943 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-20 04:12:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2022-07-20 04:12:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7261. [2022-07-20 04:12:28,660 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-20 04:12:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 10329 transitions. [2022-07-20 04:12:28,699 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 10329 transitions. Word has length 120 [2022-07-20 04:12:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 7261 states and 10329 transitions. [2022-07-20 04:12:28,700 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-20 04:12:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 10329 transitions. [2022-07-20 04:12:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-20 04:12:28,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:28,703 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-20 04:12:28,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:12:28,703 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-20 04:12:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1135512486, now seen corresponding path program 1 times [2022-07-20 04:12:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:28,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259190302] [2022-07-20 04:12:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:12:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:12:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:12:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:12:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:12:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:12:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:12:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:12:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:12:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:28,949 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-20 04:12:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:28,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259190302] [2022-07-20 04:12:28,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259190302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:28,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:28,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522885420] [2022-07-20 04:12:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:28,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:28,952 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-20 04:12:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:34,683 INFO L93 Difference]: Finished difference Result 7261 states and 10329 transitions. [2022-07-20 04:12:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:34,683 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-20 04:12:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:34,723 INFO L225 Difference]: With dead ends: 7261 [2022-07-20 04:12:34,724 INFO L226 Difference]: Without dead ends: 7259 [2022-07-20 04:12:34,732 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-20 04:12:34,733 INFO L413 NwaCegarLoop]: 3094 mSDtfsCounter, 5556 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:34,733 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.4s Time] [2022-07-20 04:12:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2022-07-20 04:12:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 7259. [2022-07-20 04:12:35,091 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-20 04:12:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 10327 transitions. [2022-07-20 04:12:35,133 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 10327 transitions. Word has length 96 [2022-07-20 04:12:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:35,134 INFO L495 AbstractCegarLoop]: Abstraction has 7259 states and 10327 transitions. [2022-07-20 04:12:35,134 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-20 04:12:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 10327 transitions. [2022-07-20 04:12:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-20 04:12:35,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:35,137 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-20 04:12:35,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:12:35,137 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-20 04:12:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1329569048, now seen corresponding path program 1 times [2022-07-20 04:12:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:35,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197546499] [2022-07-20 04:12:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:12:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:12:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:12:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:12:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:12:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:12:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:12:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:35,438 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-20 04:12:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:35,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197546499] [2022-07-20 04:12:35,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197546499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:35,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:35,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:35,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088563714] [2022-07-20 04:12:35,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:35,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:35,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:35,442 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-20 04:12:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:40,846 INFO L93 Difference]: Finished difference Result 14673 states and 21127 transitions. [2022-07-20 04:12:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:40,847 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-20 04:12:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:40,878 INFO L225 Difference]: With dead ends: 14673 [2022-07-20 04:12:40,878 INFO L226 Difference]: Without dead ends: 7435 [2022-07-20 04:12:40,910 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-20 04:12:40,911 INFO L413 NwaCegarLoop]: 3106 mSDtfsCounter, 6756 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 4524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6983 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 6833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4524 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:40,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6983 Valid, 4815 Invalid, 6833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4524 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-20 04:12:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-07-20 04:12:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7249. [2022-07-20 04:12:41,204 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-20 04:12:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10310 transitions. [2022-07-20 04:12:41,244 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10310 transitions. Word has length 124 [2022-07-20 04:12:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:41,245 INFO L495 AbstractCegarLoop]: Abstraction has 7249 states and 10310 transitions. [2022-07-20 04:12:41,245 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-20 04:12:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10310 transitions. [2022-07-20 04:12:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 04:12:41,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:41,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] [2022-07-20 04:12:41,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:12:41,248 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-20 04:12:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -336041078, now seen corresponding path program 1 times [2022-07-20 04:12:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581156238] [2022-07-20 04:12:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:12:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:12:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:12:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:12:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:12:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 04:12:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:12:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:12:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:41,482 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-20 04:12:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:41,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581156238] [2022-07-20 04:12:41,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581156238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:41,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:41,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072914001] [2022-07-20 04:12:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:41,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:41,485 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-20 04:12:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:46,814 INFO L93 Difference]: Finished difference Result 14657 states and 20892 transitions. [2022-07-20 04:12:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 04:12:46,815 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-20 04:12:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:46,847 INFO L225 Difference]: With dead ends: 14657 [2022-07-20 04:12:46,848 INFO L226 Difference]: Without dead ends: 7429 [2022-07-20 04:12:46,872 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-20 04:12:46,873 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 6755 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 4534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6982 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 7098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4534 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6982 Valid, 4557 Invalid, 7098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4534 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-20 04:12:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2022-07-20 04:12:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7243. [2022-07-20 04:12:47,182 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-20 04:12:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 10301 transitions. [2022-07-20 04:12:47,221 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 10301 transitions. Word has length 113 [2022-07-20 04:12:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:47,223 INFO L495 AbstractCegarLoop]: Abstraction has 7243 states and 10301 transitions. [2022-07-20 04:12:47,223 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-20 04:12:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 10301 transitions. [2022-07-20 04:12:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-20 04:12:47,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:47,225 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-20 04:12:47,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:12:47,226 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-20 04:12:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash 5687637, now seen corresponding path program 1 times [2022-07-20 04:12:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:47,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336131259] [2022-07-20 04:12:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:12:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:12:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:12:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:12:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:12:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:12:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:12:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:12:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:12:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:12:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:47,455 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-20 04:12:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336131259] [2022-07-20 04:12:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336131259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:47,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667680975] [2022-07-20 04:12:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:47,457 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-20 04:12:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:53,017 INFO L93 Difference]: Finished difference Result 7243 states and 10301 transitions. [2022-07-20 04:12:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:53,018 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-20 04:12:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:53,047 INFO L225 Difference]: With dead ends: 7243 [2022-07-20 04:12:53,047 INFO L226 Difference]: Without dead ends: 7241 [2022-07-20 04:12:53,053 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-20 04:12:53,054 INFO L413 NwaCegarLoop]: 3083 mSDtfsCounter, 5520 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:53,054 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.2s Time] [2022-07-20 04:12:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2022-07-20 04:12:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7241. [2022-07-20 04:12:53,368 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-20 04:12:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10299 transitions. [2022-07-20 04:12:53,402 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10299 transitions. Word has length 102 [2022-07-20 04:12:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 10299 transitions. [2022-07-20 04:12:53,403 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-20 04:12:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10299 transitions. [2022-07-20 04:12:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-20 04:12:53,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:53,405 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-20 04:12:53,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:12:53,405 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-20 04:12:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1765061470, now seen corresponding path program 1 times [2022-07-20 04:12:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:53,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074596423] [2022-07-20 04:12:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:12:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:12:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:12:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:12:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:12:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:12:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:12:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:12:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:12:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:12:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:12:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 04:12:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:12:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:12:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:53,692 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-20 04:12:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:53,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074596423] [2022-07-20 04:12:53,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074596423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:53,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:53,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:12:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165852718] [2022-07-20 04:12:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:53,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:12:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:53,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:12:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:12:53,694 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-20 04:13:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:05,939 INFO L93 Difference]: Finished difference Result 10926 states and 15450 transitions. [2022-07-20 04:13:05,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 04:13:05,940 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-20 04:13:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:05,982 INFO L225 Difference]: With dead ends: 10926 [2022-07-20 04:13:05,982 INFO L226 Difference]: Without dead ends: 10924 [2022-07-20 04:13:05,993 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-20 04:13:05,993 INFO L413 NwaCegarLoop]: 3485 mSDtfsCounter, 7242 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 11772 mSolverCounterSat, 5287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7374 SdHoareTripleChecker+Valid, 6996 SdHoareTripleChecker+Invalid, 17059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5287 IncrementalHoareTripleChecker+Valid, 11772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:05,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7374 Valid, 6996 Invalid, 17059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5287 Valid, 11772 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-07-20 04:13:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2022-07-20 04:13:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 10550. [2022-07-20 04:13:06,525 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-20 04:13:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 14874 transitions. [2022-07-20 04:13:06,580 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 14874 transitions. Word has length 119 [2022-07-20 04:13:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:06,581 INFO L495 AbstractCegarLoop]: Abstraction has 10550 states and 14874 transitions. [2022-07-20 04:13:06,581 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-20 04:13:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 14874 transitions. [2022-07-20 04:13:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 04:13:06,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:06,583 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-20 04:13:06,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:13:06,584 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-20 04:13:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1282682864, now seen corresponding path program 1 times [2022-07-20 04:13:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:06,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948021601] [2022-07-20 04:13:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,810 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-20 04:13:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:06,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948021601] [2022-07-20 04:13:06,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948021601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:06,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:06,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:06,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415177790] [2022-07-20 04:13:06,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:06,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:06,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:06,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:06,812 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-20 04:13:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:12,641 INFO L93 Difference]: Finished difference Result 10550 states and 14874 transitions. [2022-07-20 04:13:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:12,642 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-20 04:13:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:12,671 INFO L225 Difference]: With dead ends: 10550 [2022-07-20 04:13:12,671 INFO L226 Difference]: Without dead ends: 10548 [2022-07-20 04:13:12,675 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-20 04:13:12,676 INFO L413 NwaCegarLoop]: 3081 mSDtfsCounter, 5518 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:12,676 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.4s Time] [2022-07-20 04:13:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2022-07-20 04:13:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 10548. [2022-07-20 04:13:13,159 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-20 04:13:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14872 transitions. [2022-07-20 04:13:13,213 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14872 transitions. Word has length 108 [2022-07-20 04:13:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:13,214 INFO L495 AbstractCegarLoop]: Abstraction has 10548 states and 14872 transitions. [2022-07-20 04:13:13,214 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-20 04:13:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14872 transitions. [2022-07-20 04:13:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-20 04:13:13,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:13,216 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-20 04:13:13,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:13:13,217 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-20 04:13:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2105982114, now seen corresponding path program 1 times [2022-07-20 04:13:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:13,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40889806] [2022-07-20 04:13:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:13:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 04:13:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:13:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 04:13:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:13,487 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-20 04:13:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:13,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40889806] [2022-07-20 04:13:13,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40889806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:13:13,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463712106] [2022-07-20 04:13:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:13:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:13:13,492 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-20 04:13:13,494 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-20 04:13:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:14,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 04:13:14,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:13:14,414 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-20 04:13:14,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:13:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463712106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:14,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:13:14,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 04:13:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074673770] [2022-07-20 04:13:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:14,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:13:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:13:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:13:14,417 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-20 04:13:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:14,976 INFO L93 Difference]: Finished difference Result 21069 states and 29712 transitions. [2022-07-20 04:13:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:13:14,977 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-20 04:13:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:15,008 INFO L225 Difference]: With dead ends: 21069 [2022-07-20 04:13:15,008 INFO L226 Difference]: Without dead ends: 10542 [2022-07-20 04:13:15,045 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-20 04:13:15,046 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-20 04:13:15,046 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-20 04:13:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2022-07-20 04:13:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10542. [2022-07-20 04:13:15,501 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-20 04:13:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 14863 transitions. [2022-07-20 04:13:15,560 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 14863 transitions. Word has length 122 [2022-07-20 04:13:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:15,561 INFO L495 AbstractCegarLoop]: Abstraction has 10542 states and 14863 transitions. [2022-07-20 04:13:15,561 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-20 04:13:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 14863 transitions. [2022-07-20 04:13:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 04:13:15,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:15,563 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-20 04:13:15,597 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-20 04:13:15,791 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-20 04:13:15,792 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-20 04:13:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2455789, now seen corresponding path program 1 times [2022-07-20 04:13:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837702896] [2022-07-20 04:13:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,039 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-20 04:13:16,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:16,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837702896] [2022-07-20 04:13:16,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837702896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:16,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:16,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651083729] [2022-07-20 04:13:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:16,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:16,043 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-20 04:13:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:21,985 INFO L93 Difference]: Finished difference Result 10542 states and 14863 transitions. [2022-07-20 04:13:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:21,986 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-20 04:13:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:22,026 INFO L225 Difference]: With dead ends: 10542 [2022-07-20 04:13:22,026 INFO L226 Difference]: Without dead ends: 10540 [2022-07-20 04:13:22,033 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-20 04:13:22,034 INFO L413 NwaCegarLoop]: 3075 mSDtfsCounter, 5491 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:22,034 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.4s Time] [2022-07-20 04:13:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2022-07-20 04:13:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 10540. [2022-07-20 04:13:22,499 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-20 04:13:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 14861 transitions. [2022-07-20 04:13:22,556 INFO L78 Accepts]: Start accepts. Automaton has 10540 states and 14861 transitions. Word has length 110 [2022-07-20 04:13:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:22,558 INFO L495 AbstractCegarLoop]: Abstraction has 10540 states and 14861 transitions. [2022-07-20 04:13:22,558 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-20 04:13:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 10540 states and 14861 transitions. [2022-07-20 04:13:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-20 04:13:22,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:22,561 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-20 04:13:22,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:13:22,561 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-20 04:13:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1227318538, now seen corresponding path program 1 times [2022-07-20 04:13:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:22,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159096301] [2022-07-20 04:13:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:22,859 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-20 04:13:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159096301] [2022-07-20 04:13:22,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159096301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:22,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542034449] [2022-07-20 04:13:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:22,861 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-20 04:13:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:28,787 INFO L93 Difference]: Finished difference Result 10540 states and 14861 transitions. [2022-07-20 04:13:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:28,789 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-20 04:13:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:28,822 INFO L225 Difference]: With dead ends: 10540 [2022-07-20 04:13:28,822 INFO L226 Difference]: Without dead ends: 10538 [2022-07-20 04:13:28,829 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-20 04:13:28,830 INFO L413 NwaCegarLoop]: 3073 mSDtfsCounter, 5487 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:28,830 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.4s Time] [2022-07-20 04:13:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2022-07-20 04:13:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 10538. [2022-07-20 04:13:29,322 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-20 04:13:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10538 states to 10538 states and 14859 transitions. [2022-07-20 04:13:29,367 INFO L78 Accepts]: Start accepts. Automaton has 10538 states and 14859 transitions. Word has length 116 [2022-07-20 04:13:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:29,367 INFO L495 AbstractCegarLoop]: Abstraction has 10538 states and 14859 transitions. [2022-07-20 04:13:29,368 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-20 04:13:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10538 states and 14859 transitions. [2022-07-20 04:13:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-20 04:13:29,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:29,370 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-20 04:13:29,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:13:29,371 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-20 04:13:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1970825439, now seen corresponding path program 1 times [2022-07-20 04:13:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:29,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017103003] [2022-07-20 04:13:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-20 04:13:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 04:13:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 04:13:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 04:13:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 04:13:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:13:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:13:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:13:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:29,869 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-20 04:13:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017103003] [2022-07-20 04:13:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017103003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:13:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520376685] [2022-07-20 04:13:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:29,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:13:29,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:13:29,872 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-20 04:13:29,901 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-20 04:13:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:30,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 04:13:30,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:13:30,950 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-20 04:13:30,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:13:30,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520376685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:30,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:13:30,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 19 [2022-07-20 04:13:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954347996] [2022-07-20 04:13:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:30,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:13:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:13:30,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:13:30,953 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-20 04:13:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:32,223 INFO L93 Difference]: Finished difference Result 20562 states and 28906 transitions. [2022-07-20 04:13:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:13:32,224 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-20 04:13:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:32,262 INFO L225 Difference]: With dead ends: 20562 [2022-07-20 04:13:32,262 INFO L226 Difference]: Without dead ends: 10591 [2022-07-20 04:13:32,300 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-20 04:13:32,301 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-20 04:13:32,301 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-20 04:13:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2022-07-20 04:13:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10562. [2022-07-20 04:13:32,829 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-20 04:13:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 14891 transitions. [2022-07-20 04:13:32,885 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 14891 transitions. Word has length 135 [2022-07-20 04:13:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:32,886 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 14891 transitions. [2022-07-20 04:13:32,886 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-20 04:13:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 14891 transitions. [2022-07-20 04:13:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-20 04:13:32,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:32,889 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-20 04:13:32,924 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-20 04:13:33,115 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-20 04:13:33,115 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-20 04:13:33,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1099724524, now seen corresponding path program 1 times [2022-07-20 04:13:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:33,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503404041] [2022-07-20 04:13:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:13:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 04:13:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503404041] [2022-07-20 04:13:33,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503404041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:33,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:33,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322513215] [2022-07-20 04:13:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:33,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:33,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:33,386 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-20 04:13:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:39,237 INFO L93 Difference]: Finished difference Result 10562 states and 14891 transitions. [2022-07-20 04:13:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:39,238 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-20 04:13:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:39,272 INFO L225 Difference]: With dead ends: 10562 [2022-07-20 04:13:39,272 INFO L226 Difference]: Without dead ends: 10560 [2022-07-20 04:13:39,280 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-20 04:13:39,281 INFO L413 NwaCegarLoop]: 3071 mSDtfsCounter, 5481 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:39,281 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.3s Time] [2022-07-20 04:13:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-20 04:13:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 10560. [2022-07-20 04:13:39,708 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-20 04:13:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-20 04:13:39,843 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 122 [2022-07-20 04:13:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:39,844 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-20 04:13:39,844 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-20 04:13:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-20 04:13:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 04:13:39,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:39,847 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-20 04:13:39,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:13:39,847 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-20 04:13:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash -894151915, now seen corresponding path program 1 times [2022-07-20 04:13:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985577676] [2022-07-20 04:13:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:13:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:13:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:40,098 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-20 04:13:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:40,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985577676] [2022-07-20 04:13:40,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985577676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:40,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:40,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078108323] [2022-07-20 04:13:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:40,102 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-20 04:13:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:46,236 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-20 04:13:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:46,238 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-20 04:13:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:46,261 INFO L225 Difference]: With dead ends: 10560 [2022-07-20 04:13:46,262 INFO L226 Difference]: Without dead ends: 10558 [2022-07-20 04:13:46,265 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-20 04:13:46,266 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 5475 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:46,266 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.5s Time] [2022-07-20 04:13:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-20 04:13:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-20 04:13:46,664 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-20 04:13:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-20 04:13:46,704 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 128 [2022-07-20 04:13:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:46,705 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-20 04:13:46,705 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-20 04:13:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-20 04:13:46,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-20 04:13:46,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:46,708 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-20 04:13:46,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:13:46,708 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-20 04:13:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 150555854, now seen corresponding path program 1 times [2022-07-20 04:13:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:46,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834017186] [2022-07-20 04:13:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:13:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:13:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:13:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:46,960 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-20 04:13:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:46,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834017186] [2022-07-20 04:13:46,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834017186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:46,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:46,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812591103] [2022-07-20 04:13:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:46,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:46,963 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-20 04:13:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:52,553 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-20 04:13:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:52,554 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-20 04:13:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:52,586 INFO L225 Difference]: With dead ends: 10558 [2022-07-20 04:13:52,586 INFO L226 Difference]: Without dead ends: 10556 [2022-07-20 04:13:52,593 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-20 04:13:52,594 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 5469 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:52,594 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.0s Time] [2022-07-20 04:13:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-20 04:13:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-20 04:13:53,008 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-20 04:13:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-20 04:13:53,049 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 134 [2022-07-20 04:13:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:53,049 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-20 04:13:53,049 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-20 04:13:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-20 04:13:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 04:13:53,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:53,053 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-20 04:13:53,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:13:53,053 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-20 04:13:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -931896786, now seen corresponding path program 1 times [2022-07-20 04:13:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:53,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510254696] [2022-07-20 04:13:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 04:13:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 04:13:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 04:13:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 04:13:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 04:13:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 04:13:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-20 04:13:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 04:13:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 04:13:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-20 04:13:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:13:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:13:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:53,412 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-20 04:13:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510254696] [2022-07-20 04:13:53,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510254696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:13:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406495011] [2022-07-20 04:13:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:13:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:13:53,415 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-20 04:13:53,417 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-20 04:13:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 04:13:54,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:13:54,401 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-20 04:13:54,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:13:54,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406495011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:54,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:13:54,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 12 [2022-07-20 04:13:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245673926] [2022-07-20 04:13:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:13:54,406 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-20 04:13:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:55,214 INFO L93 Difference]: Finished difference Result 21742 states and 30764 transitions. [2022-07-20 04:13:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:55,215 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-20 04:13:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:55,263 INFO L225 Difference]: With dead ends: 21742 [2022-07-20 04:13:55,264 INFO L226 Difference]: Without dead ends: 11376 [2022-07-20 04:13:55,304 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-20 04:13:55,304 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:55,305 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.3s Time] [2022-07-20 04:13:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11376 states. [2022-07-20 04:13:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11376 to 10560. [2022-07-20 04:13:55,752 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-20 04:13:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-20 04:13:55,799 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 151 [2022-07-20 04:13:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:55,800 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-20 04:13:55,800 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-20 04:13:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-20 04:13:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-20 04:13:55,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:55,803 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-20 04:13:55,827 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-20 04:13:56,006 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-20 04:13:56,007 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-20 04:13:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2137124343, now seen corresponding path program 1 times [2022-07-20 04:13:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:56,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14793703] [2022-07-20 04:13:56,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:13:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:13:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:13:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:13:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:13:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:13:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:13:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:13:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:13:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:13:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:13:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:13:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:13:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:13:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:13:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:13:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:56,331 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-20 04:13:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:56,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14793703] [2022-07-20 04:13:56,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14793703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:56,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:56,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922214982] [2022-07-20 04:13:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:56,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:56,334 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-20 04:14:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:02,323 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-20 04:14:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:02,326 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-20 04:14:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:02,371 INFO L225 Difference]: With dead ends: 10560 [2022-07-20 04:14:02,371 INFO L226 Difference]: Without dead ends: 10558 [2022-07-20 04:14:02,380 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-20 04:14:02,380 INFO L413 NwaCegarLoop]: 3065 mSDtfsCounter, 5463 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:02,381 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.4s Time] [2022-07-20 04:14:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-20 04:14:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-20 04:14:02,892 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-20 04:14:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-20 04:14:02,932 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 140 [2022-07-20 04:14:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:02,932 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-20 04:14:02,932 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-20 04:14:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-20 04:14:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-20 04:14:02,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:02,934 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-20 04:14:02,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 04:14:02,934 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-20 04:14:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -938020630, now seen corresponding path program 1 times [2022-07-20 04:14:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:02,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177686497] [2022-07-20 04:14:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:14:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:14:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:14:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:14:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:14:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:14:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:14:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:14:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:14:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:14:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:14:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:14:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:14:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:14:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-20 04:14:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,202 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-20 04:14:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177686497] [2022-07-20 04:14:03,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177686497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:03,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:03,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662560064] [2022-07-20 04:14:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:03,204 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-20 04:14:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:09,661 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-20 04:14:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:09,663 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-20 04:14:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:09,688 INFO L225 Difference]: With dead ends: 10558 [2022-07-20 04:14:09,689 INFO L226 Difference]: Without dead ends: 10556 [2022-07-20 04:14:09,692 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-20 04:14:09,693 INFO L413 NwaCegarLoop]: 3063 mSDtfsCounter, 5457 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:09,693 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.7s Time] [2022-07-20 04:14:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-20 04:14:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-20 04:14:10,127 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-20 04:14:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-20 04:14:10,167 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 146 [2022-07-20 04:14:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:10,167 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-20 04:14:10,167 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-20 04:14:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-20 04:14:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 04:14:10,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:10,169 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-20 04:14:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:14:10,169 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-20 04:14:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:10,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1073850845, now seen corresponding path program 1 times [2022-07-20 04:14:10,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:10,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080715890] [2022-07-20 04:14:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 04:14:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 04:14:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 04:14:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 04:14:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 04:14:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 04:14:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:14:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 04:14:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 04:14:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 04:14:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 04:14:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-20 04:14:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:14:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 04:14:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-20 04:14:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 04:14:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:10,434 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-20 04:14:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080715890] [2022-07-20 04:14:10,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080715890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:10,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:10,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705794349] [2022-07-20 04:14:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:10,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:10,437 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-20 04:14:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:16,321 INFO L93 Difference]: Finished difference Result 10556 states and 14885 transitions. [2022-07-20 04:14:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:16,322 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-20 04:14:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:16,361 INFO L225 Difference]: With dead ends: 10556 [2022-07-20 04:14:16,362 INFO L226 Difference]: Without dead ends: 10554 [2022-07-20 04:14:16,369 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-20 04:14:16,370 INFO L413 NwaCegarLoop]: 3061 mSDtfsCounter, 5451 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:16,370 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.2s Time] [2022-07-20 04:14:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2022-07-20 04:14:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10554. [2022-07-20 04:14:16,873 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-20 04:14:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 14883 transitions. [2022-07-20 04:14:16,912 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 14883 transitions. Word has length 152 [2022-07-20 04:14:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:16,912 INFO L495 AbstractCegarLoop]: Abstraction has 10554 states and 14883 transitions. [2022-07-20 04:14:16,912 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-20 04:14:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 14883 transitions. [2022-07-20 04:14:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-20 04:14:16,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:16,914 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-20 04:14:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:14:16,914 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-20 04:14:16,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash -242444843, now seen corresponding path program 1 times [2022-07-20 04:14:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:16,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632504799] [2022-07-20 04:14:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:14:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 04:14:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:14:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:14:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 04:14:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:14:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:17,193 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-20 04:14:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:17,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632504799] [2022-07-20 04:14:17,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632504799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:17,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:17,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:14:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945212054] [2022-07-20 04:14:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:17,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:14:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:14:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:14:17,195 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-20 04:14:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:30,245 INFO L93 Difference]: Finished difference Result 22631 states and 33041 transitions. [2022-07-20 04:14:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 04:14:30,246 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-20 04:14:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:30,296 INFO L225 Difference]: With dead ends: 22631 [2022-07-20 04:14:30,296 INFO L226 Difference]: Without dead ends: 12102 [2022-07-20 04:14:30,327 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-20 04:14:30,327 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 4582 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 10018 mSolverCounterSat, 4155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 14173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4155 IncrementalHoareTripleChecker+Valid, 10018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:30,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 6755 Invalid, 14173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4155 Valid, 10018 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2022-07-20 04:14:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2022-07-20 04:14:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 10838. [2022-07-20 04:14:30,891 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-20 04:14:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 15581 transitions. [2022-07-20 04:14:30,933 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 15581 transitions. Word has length 176 [2022-07-20 04:14:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:30,934 INFO L495 AbstractCegarLoop]: Abstraction has 10838 states and 15581 transitions. [2022-07-20 04:14:30,934 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-20 04:14:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 15581 transitions. [2022-07-20 04:14:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-20 04:14:30,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:30,937 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-20 04:14:30,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:14:30,937 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-20 04:14:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash 573026121, now seen corresponding path program 1 times [2022-07-20 04:14:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:30,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053696376] [2022-07-20 04:14:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 04:14:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 04:14:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 04:14:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 04:14:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 04:14:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 04:14:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 04:14:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 04:14:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 04:14:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 04:14:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 04:14:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 04:14:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:31,223 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-20 04:14:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:31,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053696376] [2022-07-20 04:14:31,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053696376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:31,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:31,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:14:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553710380] [2022-07-20 04:14:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:31,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:14:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:14:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:14:31,227 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)